Approximate Multipartite Version of the Hajnal–Szemerédi Theorem

(ALFABÉTICO) BÉLA CSABA, MARCELO MYDLARZ

Nashville, Tennessee, Estados Unidos

Congreso; 21st Cumberland Conference on Graph Theory, Combinatorics, and Computing; 2008

Vanderbilt University (auspiciado por Shanks Endowment, College of Art and Science y National Science Foundation - Estados Unidos)

Let q be a positive integer, and G be a q-partite simple graph on qn vertices, with n vertices in each vertex class. Let δ = k/(k+1), where k = q + O(log q). If each vertex of G is adjacent to at least δn vertices in each of the other vertex classes, q is bounded and n is large enough, then G has a K_q -factor.