Cycles · Cycles of Even Length (Optional)

Lesson 5

Nikolai Chukhin · Alexander S. Kulikov

Problem. Let \(P\) be the path with vertices \([9]\) and edges \(\{i,i+1\}\) for \(i \in [8]\). What is the maximum possible number of colors in a \(3\)-periodic coloring of \(P\)?

1 point