Exponential lower-bound conjecture for high-covering-number intersecting hypergraphs
Statement
For integers , let
where the maximum is over intersecting families with covering number . In particular, is the Erdős–Lovász quantity. Exponential lower-bound conjecture. There is an absolute constant such that
for all . This is posed as an open problem about intersecting -graphs that cannot be covered by vertices; the source gives no resolution.
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.