A note on the log-concavity of parking functions

Abstract

We settle a conjecture of Bóna regarding the log-concavity of a certain statistic on parking functions by utilizing recent log-concavity results on matroids. This result allows us to also prove that connected, labeled graphs graded by their number of edges are log-concave. Furthermore, we generalize these results to $G$-parking functions.