--- title: Biclique Partition Number url: https://www.emergentmind.com/topics/biclique-partition-number type: topic --- # Biclique Partition Number Searching arXiv for recent papers on biclique partition number and related results. The **biclique partition number** is a graph parameter that measures the minimum number of complete bipartite subgraphs needed to partition the edge set of a graph. For a graph \(G\), a biclique is a complete bipartite subgraph of \(G\), and \(bp(G)\) denotes the least number of bicliques whose edge-sets partition \(E(G)\) exactly once [1307.6363], [2203.02837]. This parameter occupies a central position at the interface of extremal graph theory, graph decompositions, matrix factorization, communication-style rectangle partitions, and, in some settings, algebraic and topological invariants of associated constructions [2502.06730], [2410.15213]. Classical results such as the Graham–Pollak theorem identify \(bp(K_n)=n-1\) for complete graphs, while recent work has developed upper and lower bounds, asymptotics, algorithmic heuristics, structural exact formulas for special graph classes, random-graph thresholds, and links to regularity, independence complexes, and binary rank [1307.6363], [2005.02529], [2206.13490], [2410.15213]. ## 1. Definitions and basic variants Let \(G=(V,E)\) be a finite simple graph. A biclique is a complete bipartite subgraph \(K_{A,B}\subseteq G\) [1307.6363]. In the standard edge-partition formulation, a biclique partition of \(G\) is a collection of bicliques whose edge-sets partition \(E(G)\), and the biclique partition number \(bp(G)\) is the minimum size of such a partition [1307.6363], [2203.02837]. Several papers use the synonymous term *biclique decomposition* for an edge-partition into bicliques [2606.09785]. A distinct notion, emphasized in recent work on subdivision graphs, is the **biclique vertex partition number**. There, one partitions the vertex set rather than the edge set: if \(V(G)\) can be partitioned into \(k\) bicliques, then the minimum such \(k\) is again denoted \(bp(G)\) in that paper’s notation [2410.15213]. Because both the edge-partition and vertex-partition parameters appear in the literature under the same symbol, disambiguation depends on context. In the edge-partition setting, \(bp(G)\) interacts naturally with adjacency matrices, covers, and decompositions of \(E(G)\) [1307.6363], [2502.06730]. In the vertex-partition setting, it appears in inequalities relating graph decompositions to Castelnuovo–Mumford regularity of subdivision graphs [2410.15213]. Several standard variants refine the edge-partition problem. The biclique cover number \(bc(G)\) is the minimum number of bicliques whose union covers all edges, without requiring disjointness [1307.6363]. Local versions constrain how many bicliques may contain a given vertex, leading to the local biclique cover number \(lbc(G)\) and local biclique partition number \(lbp(G)\) [1307.6363]. A multiplicity-\(k\) generalization, denoted \(bp_k(G)\), asks for the minimum number of bicliques needed so that every edge is covered exactly \(k\) times [2005.02529]. For complete graphs, an “almost balanced ordered” extension further constrains the orientation balance with which each edge is covered [2606.08506]. The parameter also has a matrix-theoretic formulation in the bipartite case. If \(A\in\{0,1\}^{n\times m}\) and \(G_A\) is the associated bipartite graph, then the binary rank of \(A\) equals the biclique partition number of \(G_A\), written \(\bp(G_A)=\bp(A)=\rank_{01}(A)\) [2502.06730]. This identification is one of the principal reasons biclique partitions recur in matrix factorization and combinatorial optimization. ## 2. Classical results and foundational bounds The foundational theorem is the Graham–Pollak theorem: for the complete graph \(K_n\), \[ bp(K_n)=n-1. \] This appears repeatedly as the canonical exact evaluation of biclique partition number [1307.6363], [2507.08114]. It shows that even though \(K_n\) is highly symmetric, its edge set cannot be partitioned into fewer than \(n-1\) bicliques. The theorem has standard proofs via linear algebra, rank arguments, or addressing interpretations in \(\{0,1,*\}^{n-1}\) [2507.08114], [2606.08506]. A complementary comparison involves the biclique cover number. For complete graphs, \[ bc(K_n)=\lceil \log n\rceil,\qquad bp(K_n)=n-1, \] so in general the partition number can be exponentially larger than the cover number [1307.6363]. More broadly, if \(bc(G)=t\), then \[ bp(G)\le \tfrac12(3^{bc(G)}-1), \] and this bound is best possible [1307.6363]. The proof proceeds by embedding \(G\) as an induced subgraph of a universal graph on \(\{0,1,*\}^t\), then computing the biclique partition number of that universal graph exactly [1307.6363]. Lower bounds often come from linear algebra. If \(A(G)\) is the adjacency matrix of \(G\), then every biclique has rank \(2\), yielding \[ bp(G)\ge \tfrac12\,\rank A(G) \] via a theorem attributed there to Tverberg [1307.6363]. For complete graphs this aligns with the Graham–Pollak phenomenon, though the sharp lower bound requires a more refined argument [1307.6363], [2606.08506]. The following table summarizes several basic quantities and exact values recorded in the literature. | Graph or parameter | Value or bound | Source | |---|---:|---| | \(bp(K_n)\) | \(n-1\) | [1307.6363] | | \(bc(K_n)\) | \(\lceil\log n\rceil\) | [1307.6363] | | If \(bc(G)=t\) | \(bp(G)\le \tfrac12(3^t-1)\) | [1307.6363] | | \(bp(Q_d)=bc(Q_d)\) | \(2^{d-1}\) | [1307.6363] | | \(lbc(Q_d)=lbp(Q_d)\) for even \(d\) | \(d/2\) | [1307.6363] | These results establish a recurring theme: edge partitions into bicliques are substantially more rigid than covers, and exact partition counts tend to encode nontrivial structural information. ## 3. Algorithmic complexity and constructive methods Computing biclique partition number is generally hard. For the vertex-partition parameter, the decision problem “\(bp(G)\le k\)?” is NP-complete in general and remains NP-hard even when \(G\) is bipartite, including restricted subclasses such as chordal bipartite graphs [2410.15213]. For the edge-partition setting, recent papers state that computing \(bp(G)\) or \(bp_k(G)\) is NP-hard [2005.02529]. This computational hardness motivates both structural exact formulas on special classes and heuristic or approximation-style constructions. For co-chordal graphs \(G\), meaning \(G^c\) is chordal, a constructive upper bound is available: \[ bp(G)\le mc(G^c)-1, \] where \(mc(G^c)\) denotes the number of maximal cliques of the complement [2203.02837]. The proof uses a clique tree of \(G^c\). Recursively deleting a clique-tree edge \(e\) with middle set \(mid(e)\) defines vertex sets \(L\) and \(R\) such that \((L,R)\) is a biclique in \(G\), and the recursion yields exactly \(mc(G^c)-1\) bicliques [2203.02837]. The same paper gives two explicit heuristics. A clique-tree divide-and-conquer heuristic runs in \(O(|V|^3)\), while a LexBFS-based heuristic using moplexes runs in \[ O(|V|(|V|+|E^c|)). \] Both output a biclique partition of size \(mc(G^c)-1\) [2203.02837]. Moreover, if \(G^c\) is chordal and clique vertex irreducible, then this upper bound is exact: \[ bp(G)=mc(G^c)-1. \] This exactness is obtained by combining the constructive upper bound with lower-bound arguments tied to maximal cliques and the Graham–Pollak theorem [2203.02837]. A different algorithmic direction appears in work on compact graph representations. There, the objective is not minimizing the number of bicliques, but minimizing the total vertex-incidence size of a biclique decomposition: \[ size(\mathcal B)=\sum_{B\in\mathcal B}|V(B)|. \] If a graph has contiguity \(\ell(G)\), then it admits a biclique decomposition with at most \(2n\) bicliques, each vertex appearing in at most \((\ell+1)\lceil\log_2 n\rceil\) bicliques, hence \[ size(\mathcal B)\le 2n(\ell+1)\lceil\log_2 n\rceil \] [2606.09785]. More generally, if the total contiguity is \(t(G)\), then a decomposition of size \(O(t\log n)\) exists and can be output in \(O(n^2\log n)\) time [2606.09785]. This does not directly determine \(bp(G)\), but it shows how ordered neighborhood structure can force compact biclique decompositions. For bipartite graphs arising from \(0\)-\(1\) matrices, exact optimization is often replaced by linear programming. The fractional biclique partition number \[ \bp_f(A)=\min\{\mathbf 1^T x: Mx=\mathbf 1,\ x\ge 0\} \] relaxes the integer program for \(\bp(A)\), where \(M\) is the edge-biclique incidence matrix [2502.06730]. Since the number of bicliques can be doubly exponential, the paper develops a column-generation approach, with a restricted master problem, a pricing subproblem over weighted bicliques, inductive initialization for Kronecker powers, and a pruning rule that removes columns slack for more than \(s=3\) consecutive iterations [2502.06730]. This is an algorithmic contribution to the biclique-partition problem from the matrix-factorization side. ## 4. Structural formulas on special graph classes One major line of work seeks exact formulas for \(bp(G)\) on restricted graph classes. For co-chordal graphs, the general upper bound \(bp(G)\le mc(G^c)-1\) is always available [2203.02837]. For split graphs, the same paper proved \[ mc(G^c)-2\le bp(G)\le mc(G^c)-1 \] [2203.02837]. This bound already indicated that split graphs are close to the Graham–Pollak paradigm but may exhibit a one-unit gap. A 2025 note claimed the exact formula \[ bp(G)=mc(G^c)-1 \] for every split graph, presenting it as an extension of the Graham–Pollak theorem [2507.08114]. The exposition there divides split graphs into balanced and unbalanced cases and argues that the obstruction is controlled by the number of maximal cliques in the complement [2507.08114]. However, a subsequent 2026 paper disproved this conjectured exact formula by constructing a split-graph counterexample with \[ bp(G)=6,\qquad mc(G^c)=8, \] so \(bp(G)\neq mc(G^c)-1\) [2604.05491]. It further constructed an infinite family of balanced split graphs \(G_n\) on \(2n\) vertices such that \[ bp(G_n)=n-1,\qquad mc(G_n^c)=n+1, \] hence \[ bp(G_n)=mc(G_n^c)-2 \] for all \(n\ge 4\) [2604.05491]. In this sense, the earlier split-graph identity does not hold universally. At the same time, the 2026 paper reports that unbalanced split graphs do satisfy \[ bp(G)=mc(G^c)-1, \] with \(\bp(G)=\omega(G)-1\) and \(\mc(G^c)=\omega(G)\) in that case [2604.05491]. The paper also states that balanced split graphs obey \[ bp(G)\ge \omega(G)\quad\text{and}\quad bp(G)\le \omega(G), \] hence \(bp(G)=\omega(G)\), while \(\mc(G^c)=\omega(G)+1\), so the conjectured formula fails by exactly \(1\) in the balanced case [2604.05491]. This suggests that the split-graph behavior is subtler than a single complement-clique-count identity. Another structural theorem concerns chordal bipartite graphs, but here for the **vertex-partition** parameter. If \(B\) is chordal bipartite, then for the \(1\)-subdivision graph \(S(B)\), \[ reg(S(B))=|B|-bp(B), \] where \(bp(B)\) denotes the biclique vertex partition number [2410.15213]. The proof uses induction, bisimplicial edges, and a case analysis tracking simultaneous changes in regularity and partition number [2410.15213]. Although this is not the edge-partition parameter, it shows that biclique partition numbers can admit exact formulas tightly connected to graph structure. ## 5. Generalizations: local, multiple, ordered, and random settings The local parameters \(lbc(G)\) and \(lbp(G)\) reveal that global and local biclique complexity can diverge sharply. In particular, there exist graphs \(G\) with \[ lbc(G)=2\quad\text{but}\quad lbp(G)\ge k \] for every \(k\) [1307.6363]. Thus no analogue of the exponential upper bound \(bp(G)\le \tfrac12(3^{bc(G)}-1)\) holds for local measures. The construction uses graphs \(G_m\) on vectors in \(\{0,1,*\}^m\) with exactly \(m-2\) asterisks, together with induced crown subgraphs that force large local partition number [1307.6363]. For complete graphs, the multiplicity-\(k\) variant \(bp_k(K_n)\) was studied in connection with a conjecture of de Caen, Gregory, and Pritikin. For every fixed \(k\ge 1\), \[ bp_k(K_n)=(1+o(1))\,n \quad (n\to\infty), \] and more precisely, for all sufficiently large \(n\), \[ bp_k(K_n)\ge n-1,\qquad bp_k(K_n)\le n+2kn^{3/4}+k\sqrt n \] [2005.02529]. This asymptotically determines the number of bicliques needed to cover each edge of \(K_n\) exactly \(k\) times. The lower bound generalizes Graham–Pollak by a rank argument, and the upper bound uses combinatorial designs together with auxiliary coverings of small cliques and a final star-padding step [2005.02529]. An ordered and “almost balanced” extension is given by the parameter \(f(n,k)\), where each edge of \(K_n\) is covered between \(1\) and \(k\) times, and the two orientations of each covered edge must differ in multiplicity by at most \(1\) [2606.08506]. For \(k=1\), this reduces to the usual biclique partition number of \(K_n\), giving \(f(n,1)=n-1\) [2606.08506]. For \(k=2\), it recovers the ordered biclique partition number and satisfies \[ c_1 n^{1/2}\le f(n,2)\le c_2 n^{1/2+o(1)} \] for positive constants \(c_1,c_2\) [2606.08506]. More generally, for fixed \(k\ge 2\), \[ f(n,k)\ge (1+o(1))\,c_1(k)\,n^{1/(\lceil k/2\rceil+1)}, \] and \[ f(n,k)\le (1+o(1))\,c_2(k)\,n^{1/(\lfloor k/2\rfloor+1)+o(1)}, \] so for even \(k=2m\) and odd \(k=2m+1\), the exponent becomes \(1/(m+1)\) in both cases [2606.08506]. Random graphs exhibit a threshold phenomenon. For \(G_{n,p}\), there is always the trivial upper bound \[ bp(G)\le n-\alpha(G), \] obtained by partitioning edges into stars centered outside a maximum independent set [2206.13490]. A 2022 paper identifies a critical probability \(p_0\approx 0.312\), the unique root in \((0,1/2)\) of \[ 4p^3-7p^2+5p-1=0, \] and proves the following. If \(00\) such that with high probability \[ bp(G_{n,p})=n-(1+c_p)\alpha(G_{n,p}), \] and in particular \[ bp(G_{n,p})=n-(1+\Theta(1))\alpha(G_{n,p}) \] [2206.13490]. The proof is organized around “special subgraphs” whose existence is equivalent to improving upon the \(n-\alpha(G)\) star-based upper bound [2206.13490]. ## 6. Relations to algebra, topology, and matrix rank Biclique partitions connect naturally to binary rank. For a \(0\)-\(1\) matrix \(A\), the identity \[ \bp(G_A)=\bp(A)=\rank_{01}(A) \] translates biclique partition questions into exact factorizations \(A=UV\) over \(0\)-\(1\) matrices [2502.06730]. The integer-program formulation \[ \bp(A)=\min\{\mathbf 1^T x: Mx=\mathbf 1,\ x\in\{0,1\}^N\} \] and its fractional relaxation organize the problem as a column-generation LP over bicliques [2502.06730]. For the Domino graph \[ D= \begin{bmatrix} 1&1&0\\ 1&1&1\\ 0&1&1 \end{bmatrix}, \] the paper computes \[ \rho_f(D^{\otimes 1})=2.5,\; \rho_f(D^{\otimes 2})=6,\; \rho_f(D^{\otimes 3})=13.818792,\; \rho_f(D^{\otimes 4})=32.040389,\; \rho_f(D^{\otimes 5})=75.201302, \] with corresponding \(k\)th roots decreasing to \(2.372712\) at \(k=5\) [2502.06730]. From submultiplicativity and a lower bound via fractional biclique cover number, the asymptotic fractional binary rank satisfies \[ \rho_f^\infty(D)\in[2,\;2.372713]. \] The same work shows that the fractional binary rank is not multiplicative under the Kronecker product: \(\bp_f(D)=2.5\) but \(\bp_f(D\otimes D)=6<6.25\) [2502.06730]. The biclique partition number also arises indirectly in algebraic topology through graph subdivision. For any graph \(G\), the \(1\)-subdivision \(S(G)\) satisfies \[ reg(S(G))\ge |G|-bp(G), \] where \(bp(G)\) is the biclique vertex partition number and \(reg(S(G))\) is the Castelnuovo–Mumford regularity [2410.15213]. In fact, for chordal bipartite \(B\), \[ reg(S(B))=|B|-bp(B) \] [2410.15213]. The proof uses the fact that if \(G\) is partitioned into bicliques \(B_1,\dots,B_k\), then each \(B_i\) induces a copy of \(S(K_{|X_i|,|Y_i|})\) inside \(S(G)\), these copies are vertex-disjoint, and their regularities add to yield the lower bound [2410.15213]. The same paper classifies the topology of the independence complex \(\mathrm{Ind}(S(B))\) for chordal bipartite \(B\). If \(B\) admits a complete simple bisimplicial elimination sequence of length \(\ell\), then \(\mathrm{Ind}(S(B))\) is homotopy equivalent to a sphere of dimension \[ |B|-\ell-1; \] otherwise it is contractible [2410.15213]. Moreover, one can decide which case occurs in polynomial time \(O(n^4)\) and compute the sphere dimension when appropriate [2410.15213]. This is a notably different role for biclique partitioning: not as an end in itself, but as a parameter controlling regularity and homotopy type. ## 7. Examples, interpretations, and open directions A few benchmark examples recur across the literature. For complete bipartite graphs, \[ bp(K_{p,q})=1 \] in the vertex-partition setting, and for chordal bipartite graphs this matches the formula \(reg(S(B))=|B|-bp(B)\) since \(reg(S(K_{p,q}))=p+q-1\) [2410.15213]. For paths \(P_n\), the vertex-partition number satisfies \(bp(P_n)=\lceil n/2\rceil\) by covering with stars of size two, and the regularity of the \(1\)-subdivision matches \(|P_n|-\lceil n/2\rceil\) [2410.15213]. For the \(d\)-cube \(Q_d\), the edge-partition and cover numbers coincide: \[ bp(Q_d)=bc(Q_d)=2^{d-1}, \] and when \(d\) is even, \[ lbc(Q_d)=lbp(Q_d)=d/2 \] [1307.6363]. In extremal and representational contexts, biclique partitions are often interpreted as addressings or subcube representations. The exponential inequality \(bp(G)\le \tfrac12(3^{bc(G)}-1)\) is proved by encoding vertices as strings in \(\{0,1,*\}^t\), where adjacency corresponds to differing in some coordinate by \(\{0,1\}\) [1307.6363]. The same paper relates \(bc(G^c)\) to subcube intersection representations, showing that the least dimension \(d\) in which \(G\) is an intersection graph of subcubes equals \(bc(G^c)\) [1307.6363]. This suggests that biclique partitions and covers are part of a broader geometry of combinatorial encodings. Several open problems remain explicit in the cited work. For local measures, one question is whether \(lbp(G)\) can be bounded in terms of \(bc(G)=m\) under the additional condition \(lbc(G)=2\) [1307.6363]. For multiplicity covers, it remains open for fixed \(k>18\) whether \(bp_k(K_n)\) eventually equals \(n-1\) exactly, rather than merely \(n+o(n)\) [2005.02529]. In the matrix setting, the exact multiplicativity of binary rank and biclique partition number under Kronecker product remains unresolved; the fractional analogue is already known to fail [2502.06730]. In random graphs, the behavior near and beyond \(p=1/2\) remains delicate, and the case \(p=1/2\) is not settled by the threshold theorem at \(p_0\approx 0.312\) [2206.13490]. Taken together, these results show that the biclique partition number is not a single narrowly extremal parameter, but a nexus linking decomposition theory, complement structure, randomness, local-versus-global complexity, matrix rank, and even topological invariants of graph-derived complexes. The parameter is easy to define but often difficult to compute, and its exact behavior appears to depend sensitively on whether one partitions edges or vertices, whether multiplicities or locality are allowed, and which structural graph class is under consideration [2410.15213], [1307.6363], [2203.02837]. Source: https://www.emergentmind.com/topics/biclique-partition-number