Erdős Problem #719
Statement
Let be the maximum number of -edges that can be placed on vertices without forming a (the -uniform complete graph on vertices). Is every -hypergraph on vertices the union of at most many copies of and , no two of which share a ?", "difficulty": "L1" },{
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.