Counting \(H\)-free graphs (Q1918567): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:41, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting \(H\)-free graphs |
scientific article |
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
