MathDB
Correct coloring

Source: 239 2019 S8

July 31, 2020
graph theorycombinatoricsChromatic numbercycles

Problem Statement

Given a natural number k>1k> 1. Prove that if through any edge of the graph GG passes less than [e(k−1)!−1][e(k-1)! - 1] simple cycles, then the vertices of this graph can be colored with kk colors in the correct way.
Back to ProblemsView on AoPS