ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r≥3r\geq 3. For an rr-uniform hypergraph GG let τ(G)\tau(G) denote the covering number (or transversal number), the minimum size of a set of vertices which includes at least one from each edge in GG. Determine the best possible tt such that, if GG is an rr-uniform hypergraph GG where every subgraph G′G' on at most 3r−33r-3 vertices has τ(G′)≤1\tau(G')\leq 1, we have τ(G)≤t\tau(G)\leq t.

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.