On the structure of distance graphs with large chromatic numbers

DOI10.1007/s11006-006-0161-0zbMath1120.05036OpenAlexW1978123108MaRDI QIDQ881128

Andrei M. Raigorodskii

Publication date: 21 May 2007

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11006-006-0161-0

zbMATH Keywords

chromatic numberdistance graphNelson-Erdős-Hadwiger problem

Mathematics Subject Classification ID

Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• The complete intersection theorem for systems of finite sets
• Intersection theorems with geometric consequences
• The realization of distances within sets in Euclidean space

This page was built for publication: On the structure of distance graphs with large chromatic numbers