On the probability of the occurrence of a copy of a fixed graph in a random distance graph

DOI10.1134/S000143461211020XzbMath1261.05097OpenAlexW2065459306MaRDI QIDQ1946441

M. E. Zhukovskii

Publication date: 15 April 2013

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

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

zbMATH Keywords

Stirling's formulabalanced graphthreshold probabilitycomplete distance graphrandom distance graphErdős-Rényi theorem on threshold probability

Mathematics Subject Classification ID

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

Related Items (5)

Small subgraphs and their extensions in a random distance graph ⋮ Large cycles in generalized Johnson graphs ⋮ Zero-one \(k\)-law ⋮ Small Subgraphs in Random Distance Graphs ⋮ Large cycles in random generalized Johnson graphs

Cites Work

• The weak zero-one laws for the random distance graphs
• Limit theorems for complete subgraphs of random graphs
• Borsuk's problem and the chromatic numbers of some metric spaces
• On the number of vertices of given degree in a random graph
• Poisson convergence and random graphs

This page was built for publication: On the probability of the occurrence of a copy of a fixed graph in a random distance graph