✦ LIBER ✦

A bound for the number of vertices of a polytope with applications

✍ Scribed by Alexander Barvinok

Book ID: 120912587
Publisher: Springer-Verlag
Year: 2013
Tongue: English
Weight: 156 KB
Volume: 33
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-013-2870-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum number of vertices of a simp

The minimum number of vertices of a simple polytope

✍ David W. Barnette 📂 Article 📅 1971 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 220 KB

Lower bounds for the numbers of antipoda

Lower bounds for the numbers of antipodal pairs and strictly antipodal pairs of vertices in a convex polytope

✍ Mahn Hung Nguyên; Valeriu Soltan 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 574 KB

Lower Bound for the Maximal Number of Fa

Lower Bound for the Maximal Number of Facets of a 0/1 Polytope

✍ Dimitris Gatzouras; Giannopoulos Apostolos; Nikolaos Markoulakis 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 241 KB

Every Simplicial Polytope with at Mostd+

Every Simplicial Polytope with at Mostd+ 4 Vertices Is a Quotient of a Neighborly Polytope

✍ U. H. Kortenkamp 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 103 KB

A lower bound on the number of spanning

A lower bound on the number of spanning trees with k end-vertices

✍ Katherine Heinrich; Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span

A bound, in terms of its volume, for the

A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates

✍ S. V. Konyagin; K. A. Sevast'yanov 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 226 KB