Approximate multipartite version of the Hajnal-Szemerédi theorem

DOI10.1016/j.jctb.2011.10.003zbMath1239.05100arXiv0807.4463OpenAlexW2040000805MaRDI QIDQ412166

Marcelo Mydlarz, Béla Csaba

Publication date: 4 May 2012

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

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

zbMATH Keywords

regularity lemmamultipartite form of the Hajnal-Szemerédi theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Triangle-Tilings in Graphs Without Large Independent Sets ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ A geometric theory for hypergraph matching ⋮ Embedding Graphs Having Ore-Degree at Most Five ⋮ Cyclic triangle factors in regular tournaments ⋮ A multipartite Hajnal-Szemerédi theorem

Cites Work

• A fast algorithm for equitable coloring
• Quadripartite version of the Hajnal-Szemerédi theorem
• Regular spanning subgraphs of bipartite graphs of high minimum degree
• Blow-up lemma
• Tripartite version of the Corrádi-Hajnal theorem
• Triangle-factors in a balanced blown-up triangle
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• An algorithmic version of the blow-up lemma
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate multipartite version of the Hajnal-Szemerédi theorem