Turán's theorem in sparse random graphs (Q4431433): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Turán's extremal problem in random graphs: Forbidding even cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Turán's extremal problem in random graphs: Forbidding odd cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotically good list-colorings / rank | |||
Normal rank | |||
Latest revision as of 10:59, 6 June 2024
scientific article; zbMATH DE number 1995444
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Turán's theorem in sparse random graphs |
scientific article; zbMATH DE number 1995444 |
Statements
Turán's theorem in sparse random graphs (English)
0 references
22 October 2003
0 references
random graph
0 references
extremal graph theory
0 references
