Embeddability of finite distance graphs with a large chromatic number in random graphs

DOI10.1134/S1064562408010043zbMath1194.05026MaRDI QIDQ960646

S. V. Nagaeva

Publication date: 5 January 2009

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic number of Euclidean spacecomplete distance graphNelson-Erdoes-Hadwiger problem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

On the realization of random graphs as distance graphs in spaces of fixed dimension

Cites Work

• A 15-colouring of 3-space omitting distance one
• On the space chromatic number
• The realization of distances within sets in Euclidean space

This page was built for publication: Embeddability of finite distance graphs with a large chromatic number in random graphs