ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers tt and dd, let Kt(d)K_t(d) denote the complete tt-partite graph with each part of size dd. Let ff be a function and let cc be a constant.

Sigma clique covering growth conjecture. For every positive integers tt and dd, if t≥f(d)t\geq f(d), then

scc⁡(Kt(d))≥cd2tlog⁡t.\operatorname{scc}(K_t(d))\geq cd^2t\log t.

The conjecture would make the known upper bound for scc⁡(Kt(d))\operatorname{scc}(K_t(d)) sharp up to a constant factor for sufficiently large tt. It is proved in the source for d=2d=2, while the general case remains open.

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.