A game generalizing Hall's theorem
classification
🧮 math.CO
keywords
theoremgamehallcasecertaincharacterizecoloringedge
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.