Variance of the subgraph count for sparse Erdős-Rényi graphs

DOI10.1016/J.DAM.2009.11.012zbMath1225.05217OpenAlexW2147959155MaRDI QIDQ968190

Robert B. Ellis, James P. Ferry

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.012

zbMATH Keywords

variancegraph isomorphismErdős-Rényi graphsmall subgraphsubgraph plot

Mathematics Subject Classification ID

Graph polynomials (05C31) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Cites Work

• Mathematical Methods in Counterterrorism
• Threshold functions for small subgraphs
• Paths in graphs
• Some remarks on the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Variance of the subgraph count for sparse Erdős-Rényi graphs