On distance graphs with large chromatic number but without large simplices
From MaRDI portal
Publication:3521039
DOI10.1070/RM2007v062n06ABEH004493zbMath1271.05034OpenAlexW2029063046MaRDI QIDQ3521039
Publication date: 27 August 2008
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm2007v062n06abeh004493
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)
Related Items
Lower bounds for the chromatic numbers of distance graphs with large girth, On the chromatic numbers of rational spaces, Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size, Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, The chromatic number of space with forbidden regular simplex, Distance graphs with large chromatic numbers and small clique numbers, Distance graphs with large chromatic number and without cliques of given size in the rational space, Chromatic numbers of distance graphs without short odd cycles in rational spaces
