Erdős Problem #129
Statement
Let be the smallest such that if the edges of are -coloured then there is a set of vertices which does not contain a copy of in at least one of the colours. Prove that there is a constant such that
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.