Tree components in random distance graphs of special form

DOI10.1007/S10958-012-1069-8MaRDI QIDQ1948591zbMATH OpenOpenAlexFDO

Authors A. R. Yarmukhametov

Publication date 24 April 2013

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

Full work available at URL https://doi.org/10.1007/s10958-012-1069-8

zbMATH Keywords

distributiongeometric graphsnumber of tree componentsrandom distance graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• Trees in random graphs
• Random Trees in Random Graphs
• scientific article; zbMATH DE number 1380601
• Random trees in a graph and trees in a random graph
• Trees in sparse random graphs
• Gigantic component in random distance graphs of special form
• On the tree-depth of random graphs
• Gigantic and small components in random distance graphs of special form
• On tree census and the giant component in sparse random graphs

Cites work

• Borsuk's problem and the chromatic numbers of some metric spaces
• scientific article; zbMATH DE number 3769673 (Why is no real title available?)
• scientific article; zbMATH DE number 1231233 (Why is no real title available?)
• scientific article; zbMATH DE number 3187993 (Why is no real title available?)
• On a series of Ramsey-type problems in combinatorial geometry
• On the strength of connectedness of a random graph

Cited in

(2)

• Gigantic component in random distance graphs of special form
• Gigantic and small components in random distance graphs of special form

This page was built for publication: Tree components in random distance graphs of special form

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