Publisher： Elsevier
ISSN： 0195-6698
Source： European Journal of Combinatorics, Vol.21, Iss.1, 2000-01, pp. : 139-144
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Hard Lefschetz theorem for simple polytopes
Journal of Algebraic Combinatorics, Vol. 32, Iss. 2, 2010-09 ,pp. :
Access to resources
Recommend
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes
By Fleiner T. Kaibel V. Rote G.
European Journal of Combinatorics, Vol. 21, Iss. 1, 2000-01 ,pp. :
European Journal of Combinatorics, Vol. 21, Iss. 1, 2000-01 ,pp. :
By Przesławski Krzysztof Yost David
Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. :
Bulletin of the Australian Mathematical Society, Vol. 52, Iss. 1, 1995-08 ,pp. :