Linear-edge construction conjecture for sparse intersecting hypergraphs
Statement
For each positive integer , let be the minimum number of edges in an -partite intersecting hypergraph satisfying .
Linear-edge construction conjecture. The function grows linearly:
The paper proves the lower bound , but has no matching upper bound; the conjecture asks for constructions with a linear number of edges.
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.