Tiling tripartite graphs with 3-colorable graphs

Details Tiling tripartite graphs with 3-colorable graphs Tiling tripartite graphs with 3-colorable graphs

2008-04-25

arxiv.org/abs/0804.4154v1

Mathematics

Combinatorics

39 pages, 7 figures

Scientific paper

For a fixed integer h>=1, let G be a tripartite graph with N vertices in each vertex class, N divisible by 6h, such that every vertex is adjacent to at least 2N/3+h-1 vertices in each of the other classes. We show that if N is sufficiently large, then G can be tiled perfectly by copies of K_{h,h,h}. This extends the work in [19] and also gives a sufficient condition for tiling by any (fixed) 3-colorable graph. Furthermore, we show that this minimum-degree condition is best possible and provide very tight bounds when N is divisible by h but not by 6h.

Affiliated with

Also associated with

No associations

Rating

Tiling tripartite graphs with 3-colorable graphs 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 Tiling tripartite graphs with 3-colorable graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tiling tripartite graphs with 3-colorable graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728212