Distance graphs with large chromatic number and arbitrary girth

zbMath1270.05044arXiv1306.3921MaRDI QIDQ1946751

Andrey B. Kupavskii

Publication date: 15 April 2013

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3921

zbMATH Keywords

chromatic numbergirthforbidden subgraphsdistance graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Ramsey theory (05D10)

Related Items (10)

Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ On the chromatic numbers of rational spaces ⋮ Improvements of the Frankl-Rödl theorem and geometric consequences ⋮ On a Frankl-Wilson theorem ⋮ On a Frankl-Rödl theorem and its geometric corollaries ⋮ On the Frankl–Rödl theorem ⋮ Two notions of unit distance graphs ⋮ The chromatic number of space with forbidden regular simplex ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ Counterexamples to Borsuk's conjecture with large girth

This page was built for publication: Distance graphs with large chromatic number and arbitrary girth