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.
Recommendations
- Cofinite graphs and groupoids and their profinite completions
- Varieties of profinite graphs
- Profinite graphs -- comparing notions
- scientific article; zbMATH DE number 3851045
- Profinite graphs and groups
- The profinite completion of the fundamental group of infinite graphs of groups
- Finiteness theorems for graphs and posets obtained by compositions
- The geometry of profinite graphs revisited
- Compactness and finite equivalence of infinite digraphs
- Completeness and related properties of the graph topology on function spaces
Cites work
- scientific article; zbMATH DE number 3112450 (Why is no real title available?)
- scientific article; zbMATH DE number 3873585 (Why is no real title available?)
- scientific article; zbMATH DE number 1219630 (Why is no real title available?)
- scientific article; zbMATH DE number 1478717 (Why is no real title available?)
- scientific article; zbMATH DE number 3234211 (Why is no real title available?)
- A geometric characterization of free formations of profinite groups
- Profinite and residually finite groups
- Topology of finite graphs
Cited in
(3)
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)