Odd Covers of Complete Graphs and Hypergraphs

Imre Leader, Ta Sheng Tan

The `odd cover number' of a complete graph is the smallest size of a family of complete bipartite graphs that covers each edge an odd number of times. For $n$ odd, Buchanan, Clifto…