On threshold probabilities for the realization of a random graph by a geometric graph

DOI10.1134/S1064562415040249zbMath1325.05150OpenAlexW2177466741MaRDI QIDQ892733

A. V. Krot

Publication date: 12 November 2015

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

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

zbMATH Keywords

diameter graphealization of a random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds for the distance Ramsey number
• Embedding of trees in Euclidean spaces
• On the realization of random graphs as distance graphs in spaces of fixed dimension
• Distance Ramsey numbers
• Two notions of unit distance graphs
• On a series of Ramsey-type problems in combinatorial geometry
• Excursions into combinatorial geometry
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters

This page was built for publication: On threshold probabilities for the realization of a random graph by a geometric graph