ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. Its biclique partition number is the minimum number of bicliques, that is, complete bipartite graphs, needed to partition the edge set of GG. Its chromatic number chi(G)chi(G) is the minimum number of stable sets in a partition of the vertex set of GG.

Huang–Sudakov's conjecture. For each integer k>0k>0, there exists a graph GG with biclique partition number kk and chromatic number at least

2clog⁡2k,2^{c \log^2 k},

for some constant c>0c>0.

If true, this graph-theoretical statement would improve the known lower bound on the nondeterministic communication complexity of the clique-versus-stable-set problem from 65log⁡n−O(1)\frac{6}{5}\log n-O(1) to Ω(log⁡2n)\Omega(\log^2 n). The exact deterministic and nondeterministic communication complexities remain unknown.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.