Erdős Problem #1105
Statement
The anti-Ramsey number is the maximum possible number of colours in which the edges of can be coloured without creating a rainbow copy of (i.e. one in which all edges have different colours). Let be the cycle on vertices. Is it true that Let be the path on vertices and . If then is equal to where if is odd and otherwise?
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.