How the upper bound conjecture was proved
From MaRDI portal
Publication:404545
DOI10.1007/S00026-014-0238-5zbMATH Open1408.05144OpenAlexW2029408589WikidataQ122941027 ScholiaQ122941027MaRDI QIDQ404545FDOQ404545
Authors: Richard P. Stanley
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
Recommendations
- How the proof of Baudet's conjecture was found
- A simple proof of the upper bound theorem
- Upper bound for the conjecture of an inequality
- A new proof of the Howe Conjecture
- On the upper bound of the multiplicity conjecture
- Remarks on the upper bound theorem.
- How the proof of the strong perfect graph conjecture was found
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
- On the Bounded Height Conjecture
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of commutative algebra (05E40)
Cites Work
- Preferential Arrangements
- Title not available (Why is that?)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- A combinatorial distribution problem
- Linear homogeneous Diophantine equations and magic labelings of graphs
- Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
- On the asymptotics of higher dimensional partitions
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Title not available (Why is that?)
- Dimension filtration, sequential Cohen-Macaulayness and a new polynomial invariant of graded algebras
- A non-partitionable Cohen-Macaulay simplicial complex
- How the proof of Baudet's conjecture was found
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
This page was built for publication: How the upper bound conjecture was proved
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404545)