Erdős problem 1105
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).
Erdős Problems records this as proved.
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal2 retained
- Resolutionproved
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it318 share a topic
None carries a Standing. Browse the topic.