✦ LIBER ✦

Upper bound on the number of vertices of polyhedra with -constraint matrices

✍ Scribed by Khaled Elbassioni; Zvi Lotker; Raimund Seidel

Book ID: 108153473
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 96 KB
Volume: 100
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.05.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of vertices of random conv

On the number of vertices of random convex polyhedra

✍ A. Prékopa 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 936 KB

On the Number of Vertices of Random Poly

On the Number of Vertices of Random Polyhedra with a Given Number of Facets

✍ Buchta, Christian 📂 Article 📅 1987 🏛 Society for Industrial and Applied Mathematics ⚖ 542 KB

On the upper bounds of the minimum numbe

On the upper bounds of the minimum number of rows of disjunct matrices

✍ Yongxi Cheng; Ding-Zhu Du; Guohui Lin 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 134 KB

The singular acyclic matrices with maxim

The singular acyclic matrices with maximal number of P-vertices

✍ Du, Zhibin; da Fonseca, C.M. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 225 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

New upper bounds on the spectral radius

New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree

✍ Song, Haizhou; Wang, Qiufen; Tian, Lulu 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 386 KB