A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems

The biclique partition number of a graph $G$, denoted $\mathrm{bp}(G)$, is the minimum number of biclique subgraphs needed to partition the edge set of $G$. Lyu and Hicks \cite{lyu2023finding} posed the open problem of whether $\mathrm{bp}(G)=\mathrm{mc}(G^c)-1$ holds for every co-chordal graph or split graph, where $\mathrm{mc}(G^c)$ denotes the number of maximal cliques in the complement of $G$. Such a result would extend the celebrated Graham–Pollak theorem to a more general class of graphs. In this note, we answer this problem in the negative by providing a counterexample using a split graph. We also construct an infinite family of counterexamples and prove some structural properties of biclique partitions of split graphs. Finally, we solve an open problem posed by Siewert \cite{siewert2000biclique} on the existence of singular $n$-tournaments with binary rank $n$.