A game generalizing Hall's theorem
Combinatorics
2012-10-23 v4
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.
Cite
@article{arxiv.1204.0139,
title = {A game generalizing Hall's theorem},
author = {Landon Rabern},
journal= {arXiv preprint arXiv:1204.0139},
year = {2012}
}
Comments
expanded based on referee comments