×

# Colouring proofs for beginners

Can anybody please explain me with examples, how to solve tough colouring related problems ( as in CRMO-4 question paper).

Please give me some advice on how to solve these kind of problems.

PS: I've already tried Arthur Engel. So please give me important methods and not the basic idea.

Note by Priyansh Sangule
3 years, 10 months ago

Sort by:

Hi priyansh sangule, I suggest that you wait for a while because I will soon talk about imo standard coloring problens in my daily elementary techniques in the imo posts.

- 3 years, 10 months ago

Thank you!

- 3 years, 10 months ago

here's the answer- Since there are three red vertices than among the remaining 17 vertices there are nine of them of the same colour, say blue. We can divide the vertices of the regular 20-gon into four disjoint sets such that each set consists of vertices that form a regular pentagon. Since there are nine blue points, at least one of these sets will have three blue points. Since any three points on a pentagon form an isosceles triangle, the statement follows

another solution-

divide the 20-gon in 4 pentagon so that we can have isosceles triangle in each of these pentagon by joining any three vertices. now as there are 3 red vertices than we are left with 17 vertices. now there will be 1 pentagon which will not have any red vertice as by pigeonhole principle and also by pigeonhole principle that pentagon should have 3 vertices with same colour. hence it follows that there are 3 vertices with same colour such that they form an isosceles triangle.

and btw priyansh did u qualified RMO?

- 3 years, 10 months ago

No Aditya, I couldn't but some of my friends did. And Thanx for the solution !

- 3 years, 8 months ago