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
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3233642 (Why is no real title available?)
- scientific article; zbMATH DE number 3420754 (Why is no real title available?)
- A combinatorial distribution problem
- Linear homogeneous Diophantine equations and magic labelings of graphs
- On the asymptotics of higher dimensional partitions
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Preferential Arrangements
- Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
Cited in
(5)- 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
- A non-partitionable Cohen-Macaulay simplicial complex
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)
