Counting \(H\)-free graphs (Q1918567)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting \(H\)-free graphs |
scientific article; zbMATH DE number 906916
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting \(H\)-free graphs |
scientific article; zbMATH DE number 906916 |
Statements
Counting \(H\)-free graphs (English)
0 references
18 July 1996
0 references
We estimate the cardinality of the class of all \(H\)-free graphs on \(n\) (labelled) vertices with \(m\) edges by establishing good bounds for the probability that a random graph in the \(G(n, m)\)-model does not contain a given subgraph.
0 references
cardinality
0 references
\(H\)-free graphs
0 references
probability
0 references
random graph
0 references
0.9378541
0 references
0.9038478
0 references
0 references
0 references
0.89951587
0 references
0.8983644
0 references
0.8973839
0 references
