A game generalizing Hall's theorem

2012/03/31 by Rabern, Landon
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1204.0139

Abstract

We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.

Related

• Playing cards with Vizing's demon
• The Edge-Distinguishing Game
• The Monty Hall Problem in the Game Theory Class
• Turning Tiles is PSPACE-complete
• The K⁴-Game