The extremal function for partial bipartite tilings
Abstract
For a fixed bipartite graph H and given number c, 0<c<1, we determine the threshold TH(c) which guarantees that any n-vertex graph with at edge density at least TH(c) contains (1-o(1))c/v(H) n vertex-disjoint copies of H. In the proof we use a variant of a technique developed by Komlos~[Combinatorica 20 (2000), 203-218]
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.