A generalized lower‐bound conjecture for simplicial polytopes (original) (raw)
Related papers
On the upper-bound conjecture for convex polytopes
Journal of Combinatorial Theory, Series B, 1971
Triangulations of simplicial polytopes
Contributions to Algebra and Geometry, 2004
Recent progress on the combinatorial diameter of polytopes and simplicial complexes
TOP, 2013
Rejoinder on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
TOP, 2013
The Minimum Number of Facets of a Convex Polytope
Journal of the London Mathematical Society, 1971
The maximum numbers of faces of a convex polytope
Mathematika, 1970
A Moore bound for simplicial complexes
Bulletin of the London Mathematical Society, 2007
On Vertices and Facets of Combinatorial 2-Level Polytopes
Lecture Notes in Computer Science, 2016
On the simplicial 3-polytopes with only two types of edges
Discrete Mathematics, 1984
Sufficiency of McMullen's conditions for/-vectors of simplicial polytopes
AMERICAN MATHEMATICAL SOCIETY, 1980
Monatshefte f�r Mathematik, 1990
Construction theorems for polytopes
Israel Journal of Mathematics, 1984
A Lower Bound for the Translative Kissing Numbers of Simplices
Combinatorica, 2000
Existence of Balanced Simplices on Polytopes
Journal of Combinatorial Theory, Series A, 2001
Polytopes with prescribed contents of (n−1)-facets
Israel Journal of Mathematics, 1978
On 2-Level Polytopes Arising in Combinatorial Settings
SIAM Journal on Discrete Mathematics
On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}
Annals of Operations Research, 1998
Extending simplicial complexes: Topological and combinatorial properties
arXiv (Cornell University), 2021
On the 0, 1 facets of the set covering polytope
Mathematical Programming, 1989
Signable posets and partitionable simplicial complexes
Discrete & Computational Geometry, 1996
On the Number of Simplicial Complexes in D
Computational Geometry: Theory and Applications - COMGEO, 1997
More facets from fences for linear ordering and acyclic subgraph polytopes
Discrete Applied Mathematics, 1994
A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes
Discrete & Computational Geometry
On Polytopal Upper Bound Spheres
Mathematika, 2013
On the representatives k-fold coloring polytope
Electronic Notes in Discrete Mathematics, 2013
A quadratic lower bound for colourful simplicial depth
Journal of Combinatorial Optimization, 2008
Elemente der Mathematik Euler's polyhedron formula – a starting point of today's polytope theory
Long Monotone Paths in Abstract Polytopes
Mathematics of Operations Research, 1976
Proving Facetness of Valid Inequalities for the Clique Partitioning Polytope
A Note on Lower Bounds for Colourful Simplicial Depth
Symmetry, 2013
Moment-angle complexes and polyhedral products for convex polytopes
arXiv (Cornell University), 2010
Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
RAIRO - Operations Research, 2016
Substitutions of polytopes and of simplicial complexes, and multigraded betti numbers
Transactions of the Moscow Mathematical Society, 2014
All 2-neighborly d-polytopes with at most d + 9 facets
arXiv (Cornell University), 2019
On the Size of Equifacetted Semi-Regular Polytopes
2011