How the upper bound conjecture was proved
From MaRDI portal
Publication:404545
DOI10.1007/s00026-014-0238-5zbMath1408.05144OpenAlexW2029408589WikidataQ122941027 ScholiaQ122941027MaRDI QIDQ404545
Publication date: 4 September 2014
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-014-0238-5
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of commutative algebra (05E40)
Related Items (4)
Dimension filtration, sequential Cohen-Macaulayness and a new polynomial invariant of graded algebras ⋮ A non-partitionable Cohen-Macaulay simplicial complex ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial distribution problem
- Linear homogeneous Diophantine equations and magic labelings of graphs
- On the asymptotics of higher dimensional partitions
- Preferential Arrangements
- Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: How the upper bound conjecture was proved