Making a \(C_6\)-free graph \(C_4\)-free and bipartite

DOI10.1016/j.dam.2015.06.008zbMath1339.05197OpenAlexW2336338640MaRDI QIDQ298970

Casey Tompkins, Scott Kensell, Ervin Gyoeri

Publication date: 21 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.06.008

zbMATH Keywords

extremal graphs4-cycles6-cyclesbipartite subgraphs

Mathematics Subject Classification ID

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

Related Items (2)

On subgraphs of \(C_{2k}\)-free graphs ⋮ On subgraphs of C_2k-free graphs and a problem of Kühn and Osthus

Cites Work

• \(C_ 6\)-free bipartite graphs and product representation of squares
• On the Turán number for the hexagon
• Four-cycles in graphs without a given even cycle

This page was built for publication: Making a \(C_6\)-free graph \(C_4\)-free and bipartite