✦ LIBER ✦

A lower bound for the permanent on Un(k, k)

✍ Scribed by D.J Hartfiel; J.W Crosby

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 239 KB
Volume: 12
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90042-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Lower bounds for permanents of Gram matr

Lower bounds for permanents of Gram matrices having a rank one principal submatrix

✍ Thomas H. Pate 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Lower bounds for the distribution functi

Lower bounds for the distribution function of a k-dimensionaln-extensible exchangeable process

✍ Marco Scarsini 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 268 KB

A lower bound for probabilistic distribu

A lower bound for probabilistic distributed algorithms

✍ Jan K Pachl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 766 KB

A lower bound for area-universal graphs

✍ Gianfranco Bilardi; Shiva Chaudhuri; Devdatt Dubhashi; K. Mehlhorn 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 525 KB

A Lower Bound for the One-Chromatic Numb

A Lower Bound for the One-Chromatic Number of a Surface

✍ V.P. Korzhik 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 487 KB