✦ LIBER ✦

A new lower bound for odd perfect numbers

✍ Scribed by Brent, Richard P.; Cohen, Graeme L.

Book ID: 115485565
Publisher: American Mathematical Society
Year: 1989
Tongue: English
Weight: 862 KB
Volume: 53
Category: Article
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1989-0968150-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Odd Perfect Numbers: Some New Issues

✍ M. V. Subbarao 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 176 KB

A lower bound for the number of transiti

A lower bound for the number of transitive perfect codes

✍ V. N. Potapov 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 537 KB

A lower bound for the number of blocks o

A lower bound for the number of blocks of designs with odd

✍ G. Horváth 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 197 KB

On the Number of -Perfect Binary Codes:

On the Number of -Perfect Binary Codes: A Lower Bound

✍ Krotov, D.S.; Avgustinovich, S.V. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 268 KB

A lower bound for irredundant Ramsey num

A lower bound for irredundant Ramsey numbers

✍ Michael Krivelevich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Given a graph G-(V,E), a vertex subset U C V is called irredundant if every vertex v E U either has no neighbours in U or there exists a vertex w E V\U such that v is the only neighbour of w in U. The irredundant Ramsey number s(m,n) is the smallest N such that any redblue edge colouring of K N yiel

New Lower Bound on the Number of Perfect

New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs

✍ Heping Zhang; Fuji Zhang 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 77 KB