Combinatorial connections in snake graphs: Tilings, lattice paths, and
perfect matchings
Combinatorial connections in snake graphs: Tilings, lattice paths, and
perfect matchings
This paper delves into the combinatorial structures underlying snake graphs, focusing on their connections to domino tilings, lattice paths, and perfect matchings. By exploring the structure of snake graphs and their associated regions, we introduce triangular snake graphs (connected acyclic directed graphs) and provide a bijection between their routes (non-intersecting …