Turán's extremal problem in random graphs: Forbidding odd cycles

DOI10.1007/BF01300129zbMath0853.05072WikidataQ97694912 ScholiaQ97694912MaRDI QIDQ1912754

Tomasz Łuczak, Yoshiharu Kohayakawa, Penny E. Haxell

Publication date: 14 May 1996

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

odd cycles; random graph; extremal subgraphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C38: Paths and cycles

05C55: Generalized Ramsey theory

Related Items

Regular pairs in sparse random graphs I, Turán's theorem in sparse random graphs, Small subsets inherit sparse \(\varepsilon\)-regularity, On \(K^ 4\)-free subgraphs of random graphs, Sandwiching random graphs: universality between random graph models, \(K_4\)-free subgraphs of random graphs revisited, Pancyclic subgraphs of random graphs, Dirac's theorem for random graphs

Cites Work

• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Random Ramsey graphs for the four-cycle
• Turán's extremal problem in random graphs: Forbidding even cycles
• Random graphs with monochromatic triangles in every edge coloring
• Extremal subgraphs of random graphs
• The Induced Size-Ramsey Number of Cycles
• Probability Inequalities for Sums of Bounded Random Variables
• On the structure of linear graphs