Erdős Problem #1017
Statement
Let be such that every graph on vertices and edges can be partitioned into at most edge-disjoint complete graphs. Estimate for .
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.