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

DOI10.1134/S1064562408010043zbMATH Open1194.05026MaRDI QIDQ960646FDOQ960646

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) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960646)