Counting \(H\)-free graphs (Q1918567): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q105583561, #quickstatements; #temporary_batch_1709751086066 |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 13:31, 24 May 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
