Hall's Marriage Theorem and Pawn Diagrams
History and Overview
2020-12-22 v2 Computer Science and Game Theory
Combinatorics
Abstract
This paper is concerned with unreachable pawn diagrams and the subset of which can be generated using Hall's Marriage Theorem. The result is 1 in 23 diagrams are unreachable by applying the theorem.
Cite
@article{arxiv.2007.14160,
title = {Hall's Marriage Theorem and Pawn Diagrams},
author = {Colin McDonagh},
journal= {arXiv preprint arXiv:2007.14160},
year = {2020}
}
Comments
There's at least a few minor errors in the results, and since I didn't intend on uploading an updated version to arXiv, I decided to withdraw this paper