Prefer a chat interface with context about you and your work?
On subgraphs of <i>C</i><sub>2<i>k</i></sub>-free graphs and a problem of Kühn and Osthus
Abstract Let c denote the largest constant such that every C 6 -free graph G contains a bipartite and C 4 -free subgraph having a fraction c of edges of G . Győri, Kensell and Tompkins showed that 3/8 ⩽ c ⩽ 2/5. We prove that c = 38. More …