Erdős Problem 616

### What is the conjecture

https://www.erdosproblems.com/616

Let $r\geq 3$. For an $r$-uniform hypergraph $G$ let $\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 $G$.

Determine the best possible $t$ such that, if $G$ is an $r$-uniform hypergraph $G$ where every subgraph $G'$ on at most $3r-3$ vertices has $\tau(G')\leq 1$, we have $\tau(G)\leq t$.

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

Start by reading the conjecture statement at erdosproblems.com/616 and the surrounding conventions in the formal-conjectures repository. Determine how this open Erdős problem should be represented and formalized, then verify that the conjecture has been added in the repository's expected form.

Written by the indexing model from the issue text.