The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph

DOI10.1017/S0963548318000202zbMath1391.05231arXiv1608.05193OpenAlexW2963749134MaRDI QIDQ3177367

Nicholas C. Wormald, Dudley Stark

Publication date: 24 July 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.05193

zbMATH Keywords

asymptotic probabilitystatistics counting isomorphic copies of a graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Asymptotic enumeration (05A16) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (1)

On the probability of nonexistence in binomial subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When are small subgraphs of a random graph normally distributed?
• For which densities are random triangle-free graphs almost surely bipartite?
• Counting \(H\)-free graphs
• On triangle-free random graphs
• On the asymptotic structure of sparse triangle free graphs

This page was built for publication: The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph