Turán's extremal problem in random graphs: Forbidding odd cycles (Q1912754): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01300129 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2039241262 / rank | |||
Normal rank |
Latest revision as of 09:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Turán's extremal problem in random graphs: Forbidding odd cycles |
scientific article |
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