Snake graphs, perfect matchings and continued fractions

Abstract

A continued fraction is a way of representing a real number by a sequence of integers. We present a new way to think about these continued fractions using snake graphs, which are sequences of squares in the plane. You start with one square, add another to the right or to the top, then another to the right or the top of the previous one, and so on. Each continued fraction corresponds to a snake graph and vice versa, via “perfect matchings” of the snake graph. We explain what this means and why a mathematician would call this a combinatorial realization of continued fractions.