Large subgraphs without complete bipartite graphs

MaRDI QIDQ6248501zbMATH OpenFDO

Authors David Conlon, Jacob Fox, Benny Sudakov

Publication date 26 January 2014

Abstract: 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.

This page was built for publication: Large subgraphs without complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6248501)