The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
From MaRDI portal
Publication:2455139
zbMath1125.05041MaRDI QIDQ2455139
Publication date: 22 October 2007
Published in: Doklady Mathematics (Search for Journal in Brave)
Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (10)
On large subgraphs with small chromatic numbers contained in distance graphs ⋮ On rainbow isosceles \(n\)-simplexes ⋮ On the chromatic numbers of some distance graphs ⋮ On the chromatic number of \(\mathbb{R}^{9}\) ⋮ Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle ⋮ Colorings of spaces, and random graphs ⋮ On the Borsuk and Erdős-Hadwiger numbers ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Around Borsuk's hypothesis ⋮ Independence numbers and chromatic numbers of some distance graphs
This page was built for publication: The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
