The extremal function for partial bipartite tilings

From MaRDI portal




Abstract: For a fixed bipartite graph H and given number c, 0<c<1, we determine the threshold T_H(c) which guarantees that any n-vertex graph with at edge density at least T_H(c) contains (1o(1))c/v(H)n vertex-disjoint copies of H. In the proof we use a variant of a technique developed by Komlos~�color{[Combinatorica 20 (2000), 203-218}]









This page was built for publication: The extremal function for partial bipartite tilings

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