Uncountable families of vertex-transitive graphs of finite degree (Q2488943): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.01.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025409234 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4414312 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:03, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uncountable families of vertex-transitive graphs of finite degree |
scientific article |
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
