ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(n,k)f(n,k) denote the maximal-clique deficiency parameter and let c(n,k)c(n,k) denote the layered-tree parameter for kk-uniform hypergraphs, as defined in the paper. Exponential relation conjecture. For every fixed integer k≥3k\ge3,

f(n,k)=Θk ⁣(2c(n,k))f(n,k)=\Theta_k\!\left(2^{c(n,k)}\right)

as n→∞n\to\infty. Equivalently,

log⁡f(n,k)=c(n,k)+Ok(1).\log f(n,k)=c(n,k)+O_k(1).

Here the constants may depend on kk. The preceding results establish this relation for k=3k=3 and show that the two parameters have substantially different growth in that case; the conjecture proposes the corresponding exponential relationship for every fixed uniformity k≥3k\ge3.

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.