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

DOI10.1134/S1064562415040249MaRDI QIDQ892733zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 1943977 (Why is no real title available?)
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring distance graphs and graphs of diameters
• Distance Ramsey numbers
• Embedding of trees in Euclidean spaces
• Excursions into combinatorial geometry
• New bounds for the distance Ramsey number
• On a series of Ramsey-type problems in combinatorial geometry
• On the realization of random graphs as distance graphs in spaces of fixed dimension
• Random graphs.
• Two notions of unit distance graphs

Cited in

(3)

• The bin-covering technique for thresholding random geometric graph properties
• The total acquisition number of random geometric graphs
• scientific article; zbMATH DE number 7263059 (Why is no real title available?)

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

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