Large subgraphs without complete bipartite graphs
Combinatorics
2014-01-28 v1
Abstract
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the size of the largest -free subgraph one can guarantee in every graph with edges? We also discuss the analogous problem for hypergraphs.
Cite
@article{arxiv.1401.6711,
title = {Large subgraphs without complete bipartite graphs},
author = {David Conlon and Jacob Fox and Benny Sudakov},
journal= {arXiv preprint arXiv:1401.6711},
year = {2014}
}
Comments
4 pages