Erdős Problem #1075
Statement
Let . There exists such that, for any , if is sufficiently large, the following holds. Any -uniform hypergraph on vertices with at least many edges contains a subgraph on vertices with at least edges, where as .
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.