Uncountable families of vertex-transitive graphs of finite degree (Q2488943)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5023281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uncountable families of vertex-transitive graphs of finite degree |
scientific article; zbMATH DE number 5023281 |
Statements
Uncountable families of vertex-transitive graphs of finite degree (English)
0 references
16 May 2006
0 references
In this succinct note the authors prove that the set of vertex-transitive graphs of finite degree is uncountable large. The proof is constructive and is based on ideas of \textit{B. H. Neumann} [J. Lond. Math. Soc. 12, 120--127 (1937; Zbl 0016.29501)].
0 references
Cayley graphs
0 references
Infinite graphs
0 references
0.8018396496772766
0 references
0.7642091512680054
0 references
0.7544006705284119
0 references
