# CSM

## Seminar

### Parking functions and acyclic orientations

Seminar Room 1, Newton Institute

#### Abstract

Given an undirected graph $G=(V,E)$, and a designated vertex $q\in V$, the notion of a $ G$-parking function (with respect to $q$) has recently been developed and studied by vari ous authors. This notion generalizes the classical notion of a parking function associated with the complete graph, and has been approached from the point of view of sandpile models, chipfiring games etc. In this talk, I will describe some of these connections and describe a simple bijection between maximum $G$-parking functions and certain acyclic orientations of $G$. Of special interest will be the graph of the discrete cube. (This is joint work with Brian Benson.)

## Comments

Start the discussion!