Cofinite graphs and their profinite completions

<p>We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions.</p><p>The idea of constructing a cofinite graph starts with defining a uniform top...

Full description

Bibliographic Details
Main Authors: Amrita Acharyya, Jon M Corson, Bikash Das
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2017-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/222
Description
Summary:<p>We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions.</p><p>The idea of constructing a cofinite graph starts with defining a uniform topological graph $\Gamma$, in an appropriate fashion. We endow abstract graphs with uniformities corresponding to separating filter bases of equivalence relations with finitely many equivalence classes over $\Gamma$. It is established that for any cofinite graph there exists a unique cofinite completion.</p>
ISSN:2338-2287