On biclique coverings
A simpler proof and more general results on biclique coverings of graphs.
It was proved in "Strong isometric dimension, biclique coverings, and Sperner's Theorem" that if a complete bipartite graph Kn,n with a perfect matching removed can be covered by k bicliques, then n ≤ (k choose ⌊k/2⌋). We give a slightly simplified proof and we show that the result is tight. Moreover we use the result to prove analogous bounds for coverings of some other classes of graphs by bicliques.
Submitted for publication to special volume of Discrete Mathematics (DM).