Atlas home || Conferences | Abstracts | about Atlas

21st Cumberland Conference on Graph Theory, Combinatorics, and Computing ---In Honor of Mike Plummer's 70th Birthday
May 15-17, 2008
Vanderbilt University
Nashville, TN, USA

Organizers
Mark Ellingham and Gexin Yu

View Abstracts
Conference Homepage

Approximate multipartite version of the Hajnal-Szemerédi theorem
by
Béla Csaba
Dept. of Mathematics, WKU
Coauthors: Marcelo Mydlarz

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

Date received: April 16, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-41.