/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
[GP71] Graham, R. L. and Pollak, H. O. (1971). "On the addressing problem for loop switching."
Bell System Tech. J. 50, pp. 2495--2519.
[Ka91] Kahn, J. (1991). "Recent results on some not-so-recent hypergraph matching and covering
problems." Extremal problems for finite sets (Visegrád), Bolyai Soc. Math. Stud. 3,
pp. 305--353.
[HS12] Huang, H. and Sudakov, B. (2012). "A counterexample to the Alon–Saks–Seymour
conjecture and related problems." Combinatorica 32, pp. 205--219.
arXiv:1002.4687
A family of k bicliques with sides A i, B i is a biclique partition of G if the
sides are disjoint and every edge of G lies in exactly one of the bicliques (and every
biclique pair is an edge of G).
It was conjectured (Alon, Saks and Seymour, c. 1991, see [Ka91]) that every graph whose edge
set is partitioned into $k$ complete bipartite subgraphs is $(k+1)$-colourable, i.e.
$\chi(G) \le \operatorname{bp}(G) + 1$ — the natural generalisation of the Graham–Pollak
theorem, which is the case $G = K_n$.
This is false: Huang and Sudakov [HS12] constructed graphs with
$\chi(G) \ge c \operatorname{bp}(G)^{6/5}$.
The edge set of $K_n$ cannot be partitioned into fewer than $n - 1$ complete bipartite
subgraphs, and $n - 1$ suffice: $\operatorname{bp}(K_n) = n - 1$.