On subgraphs of C₂k-free graphs

DOI10.1016/J.ENDM.2017.07.002MaRDI QIDQ1689968zbMATH OpenOpenAlexFDO

Authors Dániel Grósz, Abhishek Methuku, Casey Tompkins

Publication date 18 January 2018

Full work available at URL https://doi.org/10.1016/j.endm.2017.07.002

zbMATH Keywords

even cycleshigh girthsubgraphs

Mathematics Subject Classification ID

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

Recommendations

• On subgraphs of \(C_{2k}\)-free graphs and a problem of Kühn and Osthus
• Making a \(C_6\)-free graph \(C_4\)-free and bipartite
• Four-cycles in graphs without a given even cycle
• A Note on Bipartite Graphs Without 2 k -Cycles
• The number of \(C_{2\ell}\)-free graphs

Cites work

• \(C_ 6\)-free bipartite graphs and product representation of squares
• Compactness results in extremal graph theory
• Four-cycles in graphs without a given even cycle
• scientific article; zbMATH DE number 3307332 (Why is no real title available?)
• Making a \(C_6\)-free graph \(C_4\)-free and bipartite
• Minimal Regular Graphs of Girths Eight and Twelve
• On a Probabilistic Graph-Theoretical Method
• On the Turán number for the hexagon

Cited in

(9)

• On subgraph complementation to \(H\)-free Graphs
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Making a \(C_6\)-free graph \(C_4\)-free and bipartite
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• scientific article; zbMATH DE number 2044941 (Why is no real title available?)
• Four-cycles in graphs without a given even cycle
• On subgraphs of \(C_{2k}\)-free graphs and a problem of Kühn and Osthus
• A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
• A stability result for $C_{2k+1}$-free graphs

This page was built for publication: On subgraphs of \(C_{2k}\)-free graphs

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