2000 character limit reached
Hall's Marriage Theorem and Pawn Diagrams
Published 28 Jul 2020 in math.HO, cs.GT, and math.CO | (2007.14160v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.