Graph TheoryHardGraph Coloring
Graph Coloring · Hard problem
Six teams play a round-robin tournament: every pair of the teams plays each other exactly once ( games total). Each time slot may host several games, but no team can play two of its own games in the same slot. What is the minimum number of time slots needed to schedule every game?