Large subgraphs without complete bipartite graphs
Abstract
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the size of the largest Kr,s-free subgraph one can guarantee in every graph G with m edges? We also discuss the analogous problem for hypergraphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.