Equivariant log-concavity of graph matchings

For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map of Kratthenthaler and reduces to the hard Lefschetz theorem.