On subgraphs of \(C_{2k}\)-free graphs

DOI10.1016/j.endm.2017.07.002zbMath1378.05106OpenAlexW2744112731MaRDI QIDQ1689968

Abhishek Methuku, Dániel Grósz, 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 cyclessubgraphshigh girth

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Making a \(C_6\)-free graph \(C_4\)-free and bipartite
• \(C_ 6\)-free bipartite graphs and product representation of squares
• Compactness results in extremal graph theory
• On the Turán number for the hexagon
• On a Probabilistic Graph-Theoretical Method
• Four-cycles in graphs without a given even cycle
• Minimal Regular Graphs of Girths Eight and Twelve

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