Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least (frac(3, 4)) N vertices in each of the other classes. There exists an N0 such that, if N ≥ N0, then G contains a subgraph that consists of N vertex-disjoint copies of K4.
- Graph packing
- Regularity lemma
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics