Turán's extremal problem in random graphs: Forbidding odd cycles
type: Item
instance of: scholarly article
title: Turán's extremal problem in random graphs: Forbidding odd cycles
zbMATH Open document ID: 0853.05072
DOI: 10.1007/BF01300129
author: Yoshiharu Kohayakawa
author: Tomasz Łuczak
author: Penny Haxell
published in: Combinatorica
publication date: 1996-05-14T00:00:00Z
review text: 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}\).
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 878265
zbMATH Keywords: odd cycles
zbMATH Keywords: extremal subgraphs
zbMATH Keywords: random graph
MaRDI profile type: Publication
Wikidata QID: Q97694912
cites work: Extremal subgraphs of random graphs
cites work: On the structure of linear graphs
cites work: Large triangle-free subgraphs in graphs without \(K_ 4\)
cites work: Random Ramsey graphs for the four-cycle
cites work: The Induced Size-Ramsey Number of Cycles
cites work: Turán's extremal problem in random graphs: Forbidding even cycles
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Random graphs with monochromatic triangles in every edge coloring
full work available at URL: https://doi.org/10.1007/bf01300129
OpenAlex ID: W2039241262
description: scientific article; zbMATH DE number 878265