Four-cycles in graphs without a given even cycle

DOI10.1002/JGT.20048MaRDI QIDQ4667796zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On subgraphs of \(C_{2k}\)-free graphs
• scientific article; zbMATH DE number 426329
• Making a \(C_6\)-free graph \(C_4\)-free and bipartite
• Generalized Turán problems for even cycles
• On a conjecture of Erdős and Simonovits: even cycles

Cites work

• \(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₄-free subgraph of large average degree
• Girth in graphs

Cited in

(16)

• On the Turán number of some ordered even cycles
• On subgraphs of \(C_{2k}\)-free graphs
• The number of 4-cycles in triangle-free oriented graphs
• Generalized Turán problems for even cycles
• Subdivisions of a large clique in \(C_6\)-free graphs
• On a conjecture of Erdős and Simonovits: even cycles
• On the Turán number for the hexagon
• The number of \(C_{2\ell}\)-free graphs
• Making a \(C_6\)-free graph \(C_4\)-free and bipartite
• scientific article; zbMATH DE number 426329 (Why is no real title available?)
• On graphs and algebraic graphs that do not contain cycles of length 4
• scientific article; zbMATH DE number 2145243 (Why is no real title available?)
• On subgraphs of \(C_{2k}\)-free graphs and a problem of Kühn and Osthus
• A randomized embedding algorithm for trees
• On 4-connected graphs without even cycle decompositions
• Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667796)