ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer rr, let f(r)f(r) be the minimum number of edges in an rr-partite intersecting hypergraph H\mathcal{H} satisfying tau(H)≥r−1tau(\mathcal{H}) \geq r-1.

Linear-edge construction conjecture. The function f(r)f(r) grows linearly:

f(r)=Θ(r).f(r)=\Theta(r).

The paper proves the lower bound f(r)≥(3−1/18)r(1−o(1))≈2.764r(1−o(1))f(r)\geq (3-1/\sqrt{18})r(1-o(1))\approx 2.764r(1-o(1)), 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 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.