On the probability of the occurrence of a copy of a fixed graph in a random distance graph
From MaRDI portal
Publication:1946441
DOI10.1134/S000143461211020XzbMath1261.05097MaRDI QIDQ1946441
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
Stirling's formula; balanced graph; threshold probability; complete distance graph; random distance graph; Erdős-Rényi theorem on threshold probability
Related Items
Small subgraphs and their extensions in a random distance graph, Large cycles in generalized Johnson graphs, Zero-one \(k\)-law, Large cycles in random generalized Johnson graphs, Small Subgraphs in Random Distance Graphs
Cites Work