3 papers
math.CO2026
A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
Anand Babu, Ashwin Jacob
The biclique partition number of a graph \(G\), denoted \( \operatorname{bp}(G)\), is the minimum number of biclique subgraphs needed to partition the edge set of . Lyu and Hick…
math.CO2025
Exact Biclique Partition number of Split Graphs
Anand Babu, Ashwin Jacob
The biclique partition number of a graph \(G\), denoted \( \operatorname{bp}(G)\), is the minimum number of biclique subgraphs that partition the edge set of \(G\). The Graham-Poll…
math.CO2017
Bounds for the Graham-Pollak Theorem for Hypergraphs
Anand Babu, Sundar Vishwanathan
Let represent the minimum number of complete -partite -graphs required to partition the edge set of the complete -uniform hypergraph on vertices. The Graham-P…