The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
From MaRDI portal
Publication:5693810
DOI10.1070/SM2005v196n01ABEH000874zbMath1070.05044OpenAlexW1968411875MaRDI QIDQ5693810
Publication date: 28 September 2005
Published in: Sbornik: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm2005v196n01abeh000874
Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (16)
Turán-type results for distance graphs in an infinitesimal plane layer ⋮ On the chromatic numbers of some distance graphs ⋮ Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii ⋮ On the stability of the Erdös-Ko-Rado theorem ⋮ Colorings of spaces, and random graphs ⋮ On the Borsuk and Erdős-Hadwiger numbers ⋮ Colorings of the space \(\mathbb R^{n}\) with several forbidden distances ⋮ Around Borsuk's hypothesis ⋮ Chromatic numbers of metric spaces ⋮ Hamiltonian paths in distance graphs ⋮ Small Subgraphs in Random Distance Graphs ⋮ On the chromatic numbers of metric spaces with few forbidden distances ⋮ Borsuk's problem and the chromatic numbers of metric spaces ⋮ Zero-one laws for random graphs with vertices in a Boolean cube ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ 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
