On embedding of finite distance graphs with large chromatic number in random graphs

DOI10.1007/s10958-009-9594-9zbMath1201.05083OpenAlexW1995671315MaRDI QIDQ847934

S. V. Nagaeva, Andrei M. Raigorodskii

Publication date: 19 February 2010

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-009-9594-9

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 subgraphs of a random graph by diameter graphs in Euclidean spaces

Cites Work

• A 15-colouring of 3-space omitting distance one
• On the space chromatic number
• The Nelson-Erdős-Hadwiger problem and embeddings of random graphs into geometric ones
• Borsuk's problem and the chromatic numbers of some metric spaces
• The Nelson-Erdős-Hadwiger problem and a space realization of a random graph
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item

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