Tiling tripartite graphs with 3-colorable graphs: The extreme case

Kirsten Hogenson, Ryan R. Martin, Yi Zhao

There is a sufficiently large $N\in h\mathbb{N}$ such that the following holds. If $G$ is a tripartite graph with $N$ vertices in each vertex class such that every vertex is adjace…