We discuss three equivalent forms of the same problem arising in communication complexity, constraint satisfaction problems, and graph coloring. Some partial results are discussed.
['Nicolas Bousquet', 'Aurélie Lagoutte', 'Stéphan Thomassé']
Graph coloring, communication complexity and the stubborn problem (Invited talk).