Approximate Multipartite Version of the Hajnal--Szemerédi Theorem

Details Approximate Multipartite Version of the Hajnal--Szemerédi Theorem Approximate Multipartite Version of the Hajnal--Szemerédi Theorem

2008-07-28

arxiv.org/abs/0807.4463v1

Mathematics

Combinatorics

14 pages

Scientific paper

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 $\delta={k_q \over
k_q+1}$, where $k_q=q+O(\log{q})$. If each vertex of $G$ is adjacent to at
least $\delta n$ vertices in each of the other vertex classes, $q$ is bounded
and $n$ is large enough, then $G$ has a $K_q$-factor.

Affiliated with

Also associated with

No associations

Rating

Approximate Multipartite Version of the Hajnal--Szemerédi Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate Multipartite Version of the Hajnal--Szemerédi Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Multipartite Version of the Hajnal--Szemerédi Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313326