MathForces: Math Olympiads
MathForces - Math Olympiadsβeta
Login Register


Author: mathforces
Problem has been solved: 5 times

Русский язык | English Language

There is a graph with 60 vertices, and each of its edges is colored either pink or green so that there are no monochromatic cycles of length 3 and no monochromatic cycles of length 5 in the graph. What is the maximum number of edges this graph can have?

Sorry, you need to login into your account