Tiling Ferrers Diagrams

Abstract

We will show that a necessary and sufficient condition for a Ferrers board (or Young Diagrams) to be fully tileable with 1x2 dominoes requires the board to be 2-colorable such that no color is adjacent to its own color using both induction and a graph theory approach. We will walk through all prerequisite knowledge and go through the failed attempts we tried while also providing supplementary exercises that fit the topics. Plenty of background content is included, so even if you don't know much about the subject, it should still be readable. If you do know most of the background content, feel free to skip around.