Gigantic and small components in random distance graphs of special form

DOI10.1134/S0001434613010215MaRDI QIDQ1947786zbMATH OpenOpenAlexFDO

Authors A. R. Yarmukhametov

Publication date 26 April 2013

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

complete distance graphErdős-Rényi theoremgiant componentrandom distance graph

Mathematics Subject Classification ID

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

Recommendations

• Gigantic component in random distance graphs of special form
• Tree components in random distance graphs of special form
• The Evolution of Random Graphs
• Giant Component and Connectivity in Geographical Threshold Graphs
• On the probability of the occurrence of a copy of a fixed graph in a random distance graph

Cites work

• Gigantic component in random distance graphs of special form
• On the strength of connectedness of a random graph
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(8)

• Gigantic component in random distance graphs of special form
• On the probability of the occurrence of a copy of a fixed graph in a random distance graph
• Tree components in random distance graphs of special form
• Spectrum of Johnson graphs
• Giant components in random graphs
• Phase transition in random distance graphs on the torus
• Giant Component and Connectivity in Geographical Threshold Graphs
• Johnson graphs, their random subgraphs, and some of their extremal characteristics

This page was built for publication: Gigantic and small 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 Q1947786)