Infinite friendship graphs with infinite parameters

DOI10.1016/0095-8956(91)90087-ZzbMath0707.05058OpenAlexW2057800980MaRDI QIDQ918996

Eric C. Milner, Geňa Hahn, Robert E. Woodrow

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(91)90087-z

zbMATH Keywords

chromatic numbersinfinite graphsfriendship graphalmost disjoint setscommon neighbours

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite generalized friendship graphs
• Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices
• Almost-disjoint sets the dense set problem and the partition calculus
• There are 2^ℵ_α Friendship Graphs of Cardinal ℵ_α
• On chromatic number of graphs and set-systems

This page was built for publication: Infinite friendship graphs with infinite parameters