On subgraphs of C2k-free graphs and a problem of Kühn and Osthus

DOI10.1017/S0963548319000452zbMath1466.05068arXiv1708.05454MaRDI QIDQ4993100

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

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.05454

zbMATH Keywords

cyclesextremal problemsbipartite subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• 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
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• A Dual of Dilworth's Decomposition Theorem

This page was built for publication: On subgraphs of C_2k-free graphs and a problem of Kühn and Osthus