A multipartite Hajnal-Szemerédi theorem

DOI10.1016/j.jctb.2015.04.003zbMath1315.05112arXiv1201.1882OpenAlexW2029374777MaRDI QIDQ2349514

Richard Mycroft, Peter Keevash

Publication date: 22 June 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

perfect packing

Mathematics Subject Classification ID

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

Related Items (19)

An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Transversal C_k-factors in subgraphs of the balanced blow-up of C_k ⋮ 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 ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ Completion and deficiency problems ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ Triangle‐factors in pseudorandom graphs ⋮ Powers of Hamiltonian cycles in multipartite graphs ⋮ A discrepancy version of the Hajnal–Szemerédi theorem ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Cyclic triangle factors in regular tournaments ⋮ Transversal factors and spanning trees

Cites Work

• Unnamed Item
• Approximate multipartite version of the Hajnal-Szemerédi theorem
• Quadripartite version of the Hajnal-Szemerédi theorem
• Tripartite version of the Corrádi-Hajnal theorem
• Embedding large subgraphs into dense graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Degrees giving independent edges in a hypergraph
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs

This page was built for publication: A multipartite Hajnal-Szemerédi theorem