Anand Babu

collaborators

5 papers

math.CO2026

New bounds on the Graham-Pollak theorem for hypergraphs

Anand Babu

For a fixed $r$ , let $f_{r} (n)$ denote the minimum number of complete $r$ -partite $r$ -uniform hypergraphs required to partition the edge set of the complete $r$ -uniform hypergraph on…

math.CO2026

Almost balanced ordered biclique covering of graphs

Anand Babu, Ervin Ranjan, Maddipati Deshith Sai +3

Let $f (n, k)$ be the minimum size of a collection of bicliques such that (i) every edge of the complete graph $K_{n}$ is covered by at least one and at most $k$ bicliques in the colle…

math.CO2026

Improved Bounds for Multicovering Hypergraphs

Anand Babu, Sundar Vishwanathan

The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $⌈ lo g_{2} n ⌉$ . The Graham-Pollak theorem states that at least $n - 1$ …

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 $G$ . Lyu and Hick…

math.CO2026

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…