Turán's extremal problem in random graphs: Forbidding odd cycles (Q1912754)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 878265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Turán's extremal problem in random graphs: Forbidding odd cycles |
scientific article; zbMATH DE number 878265 |
Statements
Turán's extremal problem in random graphs: Forbidding odd cycles (English)
0 references
14 May 1996
0 references
For a fixed odd number \(m \geq 3\) and a sufficiently large probability \(p\), almost every random graph \(G_{n,p}\) is shown to have an \(m\)-cycle free subgraph of size arbitrarily close to half the size of \(G_{n,p}\).
0 references
odd cycles
0 references
extremal subgraphs
0 references
random graph
0 references
0.8707234859466553
0 references
0.8228068947792053
0 references
0.8065183162689209
0 references
