Counting \(H\)-free graphs

DOI10.1016/0012-365X(94)00334-FzbMath0851.05057OpenAlexW2025818193WikidataQ105583561 ScholiaQ105583561MaRDI QIDQ1918567

Angelika Steger, Hans Jürgen Prömel

Publication date: 18 July 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00334-f

zbMATH Keywords

probabilityrandom graphcardinality\(H\)-free graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (6)

The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph ⋮ Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ A new proof of the KŁR conjecture ⋮ A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs ⋮ Almost all graphs with high girth and suitable density have high chromatic number ⋮ Estimating parameters associated with monotone properties

Cites Work

• Threshold functions for small subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting \(H\)-free graphs