5

Part of 2000 Austrian-Polish Competition

Problems(1)

color the vertices of a regular n-gon using at most 6 colors

Source: Austrian - Polish 2000 APMC

For which integers

n \ge 5

is it possible to color the vertices of a regular

n

-gon using at most

6

colors in such a way that any

5

consecutive vertices have different colors?

Coloringregular polygoncombinatorics