Katona-Szemerédi-type conjecture for biclique covers
Statement
Let be a graph with chromatic number . A biclique cover is a collection of complete bipartite graphs whose union of edges contains ; 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 is at least
This generalizes the Katona-Szemerédi theorem, which gives the bound for covering the edges of the complete graph . The conjecture is not proved in the paper: the authors establish only the asymptotic lower bound for sufficiently large .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.