Gigantic component in random distance graphs of special form

DOI10.1134/S0001434612090167zbMath1292.05235MaRDI QIDQ1929782

A. R. Yarmukhametov

Publication date: 9 January 2013

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Stirling's formula\(k\)-vertex treeclassical Erdős-Rényi theoremsgigantic component in a random graphrandom distance graph

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)

Related Items (3)

Gigantic and small components in random distance graphs of special form ⋮ Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\) ⋮ Spectrum of Johnson graphs

Cites Work

• Borsuk's problem and the chromatic numbers of some metric spaces
• On the strength of connectedness of a random graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gigantic component in random distance graphs of special form