MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
2012 Miklós Schweitzer
3
3
Part of
2012 Miklós Schweitzer
Problems
(1)
Tree with k vertices
Source:
8/21/2017
There is a simple graph which chromatic number is equal to
k
k
k
. We painted all of the edges of graph using two colors. Prove that there exist a monochromatic tree with
k
k
k
vertices
combinatorics
Miklos Schweitzer