A split graph counterexample disproves the biclique partition conjecture for split graphs, with an infinite family of examples and a solution to the singular n-tournament binary rank problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
A split graph counterexample disproves the biclique partition conjecture for split graphs, with an infinite family of examples and a solution to the singular n-tournament binary rank problem.