TSTST 2014 Problem 5
- Answer
Find the maximum number such that the following holds: there is an edge-colored graph with 60 vertices and edges, with each edge colored either red or blue, such that in that coloring, there is no monochromatic cycles of length 3 and no monochromatic cycles of length 5 .
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
1350
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.