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

DOI10.1016/J.DAM.2015.06.008MaRDI QIDQ298970zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

4-cycles6-cyclesbipartite subgraphsextremal graphs

Mathematics Subject Classification ID

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

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₄-free graph bipartite
• Four-cycles in graphs without a given even cycle
• \(C_ 6\)-free bipartite graphs and product representation of squares

Cites work

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

Cited in

(5)

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

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)