Name
Abstract | ||
|---|---|---|
For any positive real number gamma and any positive integer h, there is N-0 such that the following holds. Let N >= N-0 be such that N is divisible by h. If G is a tripartite graph with N vertices in each vertex class such that every vertex is adjacent to at least (2/3 + gamma)N vertices in each of the other classes, then G can be tiled perfectly by copies of K-h,K-h,K-h. This extends the work in [Discrete Math. 254 (2002), 289-308] and also gives a sufficient condition for tiling by any fixed 3-colorable graph. Furthermore, we show that the minimum-degree (2/3 + gamma)N in our result cannot be replaced by 2N/3 + h-2. |
Year | Venue | DocType |
|---|---|---|
2009 | ELECTRONIC JOURNAL OF COMBINATORICS | Journal |
Volume | Issue | ISSN |
16.0 | 1.0 | 1077-8926 |
Citations | PageRank | References |
2 | 0.44 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryan R. Martin | 1 | 36 | 10.12 |
| Yi Zhao | 2 | 88 | 10.43 |