Making a C₆-free graph C₄-free and bipartite

DOI10.1016/J.DAM.2015.06.008zbMATH Open1339.05197OpenAlexW2336338640MaRDI QIDQ298970FDOQ298970

Authors: Scott Kensell, Casey Tompkins, Ervin Győri 

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

Recommendations

• On subgraphs of \(C_{2k}\)-free graphs
• On subgraphs of \(C_{2k}\)-free graphs and a problem of Kühn and Osthus
• Making a \(K_4\)-free graph bipartite
• Four-cycles in graphs without a given even cycle
• \(C_ 6\)-free bipartite graphs and product representation of squares

zbMATH Keywords

extremal graphs4-cycles6-cyclesbipartite subgraphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Four-cycles in graphs without a given even cycle
• Making a \(K_4\)-free graph bipartite
• On subgraphs of C_2k-free graphs and a problem of Kühn and Osthus
• On subgraphs of \(C_{2k}\)-free graphs
• Subdivisions of a large clique in \(C_6\)-free graphs

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

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