Regular bipartite decompositions of pseudorandom graphs

Asaf Ferber, Bryce Frederickson, Dingjia Mao +2

In 1972, Kotzig proved that for every even $n$, the complete graph $K_n$ can be decomposed into $\lceil {\log }_{2}n\rceil$ edge-disjoint regular bipartite spanning subgraphs, which is b…