On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces

MaRDI QIDQ5239647zbMATH OpenFDO

Authors A. V. Krot, Andrei M. Raigorodskii

Publication date 22 October 2019

Full work available at URL http://mathnet.ru/eng/cheb394

zbMATH Keywords

random graphdistance graphdiameter graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
• On the realization of random graphs as distance graphs in spaces of fixed dimension
• On the stretch factor of randomly embedded random graphs
• Small subgraphs in random distance graphs
• On the relation between graph distance and Euclidean distance in random geometric graphs

Cites work

• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 3812415 (Why is no real title available?)
• scientific article; zbMATH DE number 177380 (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
• Illuminating sets of constant width
• New bounds for the distance Ramsey number
• On Sets of Distances of n Points
• 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

(9)

• Traveling in randomly embedded random graphs
• Traveling in randomly embedded random graphs
• Embedding the diamond graph in L_p and dimension reduction in L₁
• On the relation between graph distance and Euclidean distance in random geometric graphs
• Reconstruction of random geometric graphs: breaking the \(\varOmega (r)\) distortion barrier
• On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
• Uniform linear embeddings of spatial random graphs
• Uniform linear embeddings of graphons
• On the stretch factor of randomly embedded random graphs

This page was built for publication: On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces

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