Exponential relation between maximal-clique deficiency and layered-tree parameter
Statement
Let denote the maximal-clique deficiency parameter and let denote the layered-tree parameter for -uniform hypergraphs, as defined in the paper. Exponential relation conjecture. For every fixed integer ,
as . Equivalently,
Here the constants may depend on . The preceding results establish this relation for and show that the two parameters have substantially different growth in that case; the conjecture proposes the corresponding exponential relationship for every fixed uniformity .
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.