De Caen–Gregory–Pritikin biclique-cover conjecture for complete graphs
Statement
Let be the complete graph on vertices. For a positive integer , let denote the minimum size of a collection of bicliques of in which every edge belongs to exactly bicliques.
De Caen–Gregory–Pritikin conjecture. For every positive integer ,
for all sufficiently large .
The lower bound is known for every , and the conjecture is proved for using constructions from design theory. The general case remains open; the best-known upper bound is .
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.