Combinatorial proof of the log-concavity of the sequence of matching numbers

DOI10.1006/jcta.1996.0058zbMath0847.05077OpenAlexW2066398860MaRDI QIDQ1914019

Christian Krattenthaler

Publication date: 9 July 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8502eb86f3b2c754530b0018afc614ae736dee4e

zbMATH Keywords

matchingsunimodalitylog-concavitymatching numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Dual rook polynomials ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ On the unimodality of domination polynomials ⋮ A local injective proof of log-concavity for increasing spanning forests ⋮ Equivariant log-concavity of graph matchings ⋮ Combinatorial proofs of inverse relations and log-concavity for Bessel numbers ⋮ Log-concavity of the partition function ⋮ On Stanley's chromatic symmetric function and clawfree graphs

This page was built for publication: Combinatorial proof of the log-concavity of the sequence of matching numbers