The number of \(M\)-sequences and \(f\)-vectors
From MaRDI portal
Publication:1125653
DOI10.1007/s004930050055zbMath0928.05002OpenAlexW2069487012MaRDI QIDQ1125653
Publication date: 20 December 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930050055
Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Asymptotic enumeration (05A16)
Related Items (4)
A sequence defined by \(M\)-sequences ⋮ A note on the asymptotics of the number of \(O\)-sequences of given length ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ On the shape of a pure 𝑂-sequence
This page was built for publication: The number of \(M\)-sequences and \(f\)-vectors