HMMT 2009 T8
- Team 1
- Answer
Two colorings are distinct if there is no way to relabel the colors to transform one into the other. Equivalently, they are distinct if and only if there is some pair of vertices which are the same color in one coloring but different colors in the other. For what pairs of positive integers does there exist a finite graph with chromatic number which has exactly distinct good colorings using colors?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
(1,1),\left(2,2^{k}\right) \text{ for integers } k \geq 0, \text{ and } (n, k) \text{ for } n>2, k>0
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.