ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices. For a positive integer kk, let bp⁡k(Kn)\operatorname{bp}_k(K_n) denote the minimum size of a collection of bicliques of KnK_n in which every edge belongs to exactly kk bicliques.

De Caen–Gregory–Pritikin conjecture. For every positive integer kk,

bp⁡k(Kn)=n−1\operatorname{bp}_k(K_n)=n-1

for all sufficiently large nn.

The lower bound bp⁡k(Kn)≥n−1\operatorname{bp}_k(K_n)\geq n-1 is known for every kk, and the conjecture is proved for k≤18k\leq 18 using constructions from design theory. The general case remains open; the best-known upper bound is O(kn)O(kn).

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.