Erdős Problem #809
Statement
Let and define to be the minimal such that there is a graph on vertices with many edges such that the edges can be -coloured so that every subgraph isomorphic to has no colour repeating on the edges. Is it true 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.