Tag Archives: graphs

Polynomials and Representations XII

Lindström–Gessel–Viennot Lemma Let us switch gears and describe a beautiful combinatorial result. Suppose is a graph which is directed, has no cycles, and there are only finitely many paths from a vertex to another. Given sets of n vertices: the lemma … Continue reading

Posted in Uncategorized | Tagged , , , , , , | Leave a comment