Infinite friendship graphs with infinite parameters (Q918996)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Infinite friendship graphs with infinite parameters |
scientific article |
Statements
Infinite friendship graphs with infinite parameters (English)
0 references
1991
0 references
We study infinite graphs in which every set of \(\kappa\) vertices has exactly \(\lambda\) common neighbours. We prove that there exist \(2^{\sigma}\) such graphs of each infinite order \(\sigma\) if \(\kappa\) is finite and that for \(\kappa\) infinite there are \(2^{\lambda}\) of them of order \(\lambda\) and none of cardinality greater than \(\lambda\) (assuming the GCH). Further, we show that all a priori admissible chromatic numbers are in fact possible for such graphs.
0 references
almost disjoint sets
0 references
friendship graph
0 references
infinite graphs
0 references
common neighbours
0 references
chromatic numbers
0 references
0 references