Tiling directed graphs with tournaments

Andrzej Czygrinow, Louis DeBiasio, Theodore Molla +1

The Hajnal--Szemerédi theorem states that for any integer $r\ge 1$ and any multiple $n$ of $r$, if $G$ is a graph on $n$ vertices and $\delta (G)\ge (1-1/r)n$, then $G$ can be partit…