Infinite generalized friendship graphs (Q793756): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q195165 |
Changed an Item |
||
Property / author | |||
Property / author: Charles Delorme / rank | |||
Normal rank |
Revision as of 19:49, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Infinite generalized friendship graphs |
scientific article |
Statements
Infinite generalized friendship graphs (English)
0 references
1984
0 references
Let \(\tau\geq 2\) and \(\lambda\geq 1\) be integers, and let c be an infinite cardinal number. It is shown that \(\tau \leq \lambda +1\) is necessary and sufficient for the existence of (simple) infinite graphs of order c such that every subset of \(\tau\) vertices has exactly \(\lambda\) common neighbors. Furthermore, whe\(n\tau \leq \lambda +1\) then for each c and for each d \((\tau +1\leq d\leq \aleph_ 0)\) there exist \(2^ c\) such pairwise non-isomorphic graphs of order c and chromatic number d. When \(\lambda\geq 2\), any such graph of order c and its complement must both be regular of degree c.
0 references
infinite graphs
0 references
friendship graphs
0 references