Tiling tripartite graphs with 3-colorable graphs

Ryan R. Martin, Yi Zhao

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 e…