Matching polynomials are generating functions used to count the number of matchings in a graph. They are one of several graph polynomials studied in algebraic graph theory. They are also known as acyclic polynomials.

Stanford University

Autumn 2022

The course addresses both classic and recent developments in counting and sampling. It covers counting complexity, exact counting via determinants, sampling via Markov chains, and high-dimensional expanders.

No concepts data

+ 52 more concepts