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

DOI10.1134/S1064562409010189zbMath1253.05129OpenAlexW1988932234MaRDI QIDQ1760937

S. V. Nagaeva, Andrei M. Raigorodskii

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1134/s1064562409010189

zbMATH Keywords

random graphsdistance graphslargest distance graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Unnamed Item ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Embeddability of finite distance graphs with a large chromatic number in random graphs
• On Ramsey Type Problems in Combinatorial Geometry

This page was built for publication: On the realization of random graphs as distance graphs in spaces of fixed dimension