A Bijection between Marked Parking Functions and Connected Labeled Graphs

Combinatorics/Partitions Seminar

Meeting Details

For more information about this meeting, contact Kristin Berrigan, George Andrews, Ae Ja Yee, Matthew Katz.

Speaker: David Little, Penn State University

Abstract: The starting point of this talk will be the fact that the number of parking functions of order $n$ is equal to the number of labeled trees on $n+1$ vertices. Recently, Adriano Garsia introduced the notion of marked parking functions and conjectured that they are equinumerous with connected labeled graphs on $n+1$ vertices. We will present a bijective proof of this conjecture.

Room Reservation Information

Room Number: 106 McAllister

Date: 10/15/2019

Time: 11:15am - 12:05pm