Approximate Multipartite Version of the Hajnal--Szemerédi Theorem
| dc.creator | Csaba, Bela | |
| dc.date | 2008-07-28 | |
| dc.date.accessioned | 2026-07-07T09:53:18Z | |
| dc.date.available | 2026-07-07T09:53:18Z | |
| dc.description | 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 $δ={k_q \over k_q+1}$, where $k_q=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. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/0807.4463 | |
| dc.identifier | http://arxiv.org/abs/0807.4463 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/165907 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C70 | |
| dc.title | Approximate Multipartite Version of the Hajnal--Szemerédi Theorem | |
| dc.type | text |