Counting \(H\)-free graphs (Q1918567): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q105583561 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Threshold functions for small subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3286850 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3360223 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3333079 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3975008 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3781137 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)00334-f / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2025818193 / rank | |||
Normal rank |
Latest revision as of 11:16, 30 July 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