Tripartite Version of the Corrádi-Hajnal Theorem
arXiv:1605.06647 · doi:10.1016/S0012-365X(01)00373-9
Abstract
Let be a tripartite graph with vertices in each vertex class. If each vertex is adjacent to at least vertices in each of the other classes, then either contains a subgraph that consists of vertex-disjoint triangles or is a specific graph in which each vertex is adjacent to exactly vertices in each of the other classes.
arXiv comment22 pages, 4 figures
Cited by in corpus (7)
- A Multipartite Hajnal-Szemerédi Theorem
- Embedding into bipartite graphs
- On the strong chromatic number of graphs
- Minimum degree thresholds for bipartite graph tiling
- Powers of Hamiltonian cycles in multipartite graphs
- An asymptotic multipartite Kühn-Osthus theorem
- Tiling tripartite graphs with 3-colorable graphs: The extreme case