Erdős Problem #616
Statement
Let . For an -uniform hypergraph let denote the covering number (or transversal number), the minimum size of a set of vertices which includes at least one from each edge in . Determine the best possible such that, if is an -uniform hypergraph where every subgraph on at most vertices has , we have .
Record
- Source
- Added
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.