Four-cycles in graphs without a given even cycle

DOI10.1002/jgt.20048zbMath1061.05048OpenAlexW2528403005MaRDI QIDQ4667796

Daniela Kühn, Deryk Osthus

Publication date: 21 April 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20048

zbMATH Keywords

cyclesextremal problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (7)

Making a \(C_6\)-free graph \(C_4\)-free and bipartite ⋮ On the Turán number of some ordered even cycles ⋮ On subgraphs of \(C_{2k}\)-free graphs ⋮ A randomized embedding algorithm for trees ⋮ On the Turán number for the hexagon ⋮ On subgraphs of C_2k-free graphs and a problem of Kühn and Osthus ⋮ Subdivisions of a large clique in \(C_6\)-free graphs

Cites Work

• Girth in graphs
• \(C_ 6\)-free bipartite graphs and product representation of squares
• Cycles of even length in graphs
• Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree

This page was built for publication: Four-cycles in graphs without a given even cycle