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

DOI10.1007/BF01300129zbMath0853.05072OpenAlexW2039241262WikidataQ97694912 ScholiaQ97694912MaRDI QIDQ1912754

Yoshiharu Kohayakawa, Tomasz Łuczak, Penny E. Haxell

Publication date: 14 May 1996

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01300129

zbMATH Keywords

odd cyclesrandom graphextremal subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Related Items (17)

Dirac's theorem for random graphs ⋮ Sandwiching random graphs: universality between random graph models ⋮ Pancyclic subgraphs of random graphs ⋮ Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ A new proof of the KŁR conjecture ⋮ Extremal results for random discrete structures ⋮ Combinatorial theorems in sparse random sets ⋮ On \(K^ 4\)-free subgraphs of random graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ Hypergraph containers ⋮ Regular pairs in sparse random graphs I ⋮ Turán's theorem in sparse random graphs ⋮ Independent sets in hypergraphs

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

This page was built for publication: Turán's extremal problem in random graphs: Forbidding odd cycles