ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with chromatic number kk. A biclique cover is a collection of complete bipartite graphs whose union of edges contains E(G)E(G); the order of a biclique is its number of vertices.

Katona-Szemerédi-type conjecture. The sum of the orders of the bicliques in any biclique cover of E(G)E(G) is at least

klog⁡k.k\log k.

This generalizes the Katona-Szemerédi theorem, which gives the bound klog⁡kk\log k for covering the edges of the complete graph KkK_k. The conjecture is not proved in the paper: the authors establish only the asymptotic lower bound klog⁡k−klog⁡log⁡k−klog⁡log⁡log⁡kk\log k-k\log\log k-k\log\log\log k for sufficiently large kk.

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.