Quadripartite version of the Hajnal-Szemerédi theorem

DOI10.1016/j.disc.2007.08.019zbMath1152.05037OpenAlexW2067394129MaRDI QIDQ941371

Endre Szemerédi, Ryan R. Martin

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.019

zbMATH Keywords

regularity lemmaquadripartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

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, An improved bound for the monochromatic cycle partition number, 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, Triangle factors of graphs without large independent sets and of weighted graphs, On sufficient conditions for spanning structures in dense graphs, Approximate multipartite version of the Hajnal-Szemerédi theorem, On multipartite Hajnal-Szemerédi theorems, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Tiling tripartite graphs with 3-colorable graphs: the extreme case, \(K_r\)-factors in graphs with low independence number, A geometric theory for hypergraph matching, Cyclic triangle factors in regular tournaments, A multipartite Hajnal-Szemerédi theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Blow-up lemma
• Tripartite version of the Corrádi-Hajnal theorem
• Triangle-factors in a balanced blown-up triangle
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• On the square of a Hamiltonian cycle in dense graphs
• On the maximal number of independent circuits in a graph
• On the theory of graphs
• On the structure of linear graphs