Recognition: unknown
Large subgraphs without complete bipartite graphs
classification
🧮 math.CO
keywords
analogousanswerbipartitecompletediscussedgeseveryfollowing
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.