A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs

DOI10.1017/S096354831200048XzbMath1257.05130arXiv1108.4184MaRDI QIDQ4903264

Klas Markström, Allan Lo

Publication date: 21 January 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

perfect \(K_t\)-matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (17)

An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Clique decompositions of multipartite graphs and completion of Latin squares ⋮ Transversal C_k-factors in subgraphs of the balanced blow-up of C_k ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Completion and deficiency problems ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ Triangle‐factors in pseudorandom graphs ⋮ An asymptotic bound for the strong chromatic number ⋮ Powers of Hamiltonian cycles in multipartite graphs ⋮ A geometric theory for hypergraph matching ⋮ Cyclic triangle factors in regular tournaments ⋮ \(F\)-factors in hypergraphs via absorption ⋮ A multipartite Hajnal-Szemerédi theorem ⋮ Transversal factors and spanning trees

This page was built for publication: A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs