The typical structure of graphs without given excluded subgraphs (Q3633015): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/rsa.20242 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20242 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4236586398 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of graphs without forbidden subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/RSA.20242 / rank | |||
Normal rank | |||
Latest revision as of 14:07, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The typical structure of graphs without given excluded subgraphs |
scientific article |
Statements
The typical structure of graphs without given excluded subgraphs (English)
0 references
16 June 2009
0 references
extremal graphs
0 references
structure of \(H\)-free graphs
0 references
graph counting
0 references
