Cofinite graphs and their profinite completions

From MaRDI portal
Publication:5006629




Abstract: We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. 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.









This page was built for publication: Cofinite graphs and their profinite completions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006629)