David Conlon, Jacob Fox, Benny Sudakov
Published 2014-01-27Version 1
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the size of the largest $K_{r,s}$-free subgraph one can guarantee in every graph $G$ with $m$ edges? We also discuss the analogous problem for hypergraphs.
$\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs
A Note on the Equitable Choosability of Complete Bipartite Graphs
Book drawings of complete bipartite graphs
![QR code for arXiv:1401.6711 [math.CO]](http://oss.arxitics.com/images/favicon.svg)