Tripartite version of the Corrádi-Hajnal theorem

DOI10.1016/S0012-365X(01)00373-9zbMath0995.05069arXiv1605.06647MaRDI QIDQ1613547

Csaba Magyar, Ryan R. Martin

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.06647

zbMATH Keywords

regularity lemmablow-up lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (18)

An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Transversal C_k-factors in subgraphs of the balanced blow-up of C_k ⋮ Minimum degree thresholds for bipartite graph tiling ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ On factors of independent transversals in \(k\)-partite graphs ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Approximate multipartite version of the Hajnal-Szemerédi theorem ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ Quadripartite version of the Hajnal-Szemerédi theorem ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ \(K_r\)-factors in graphs with low independence number ⋮ Multipartite Ramsey numbers for odd cycles ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ Powers of Hamiltonian cycles in multipartite graphs ⋮ A geometric theory for hypergraph matching ⋮ Cyclic triangle factors in regular tournaments ⋮ A multipartite Hajnal-Szemerédi theorem

This page was built for publication: Tripartite version of the Corrádi-Hajnal theorem