✦ LIBER ✦

A lower bound for r(5, 5)

✍ Scribed by Geoffrey Exoo

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 76 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130113

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for Primality

✍ Eric Allender; Michael Saks; Igor Shparlinski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Recent work by Bernasconi, Damm, and Shparlinski showed that the set of square-free numbers is not in AC 0 and raised as an open question whether similar (or stronger) lower bounds could be proved for the set of prime numbers. We show that the Boolean majority function is AC 0 -Turing reducible to t

A lower bound for level spacings

✍ Elliott H Lieb; Walter E Thirring 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 352 KB

We consider a single particle in a negative potential V: H = --d + V(x). A lower bound is found for the quantity +I -EW, where cm is the ground-state energy of H in all space and where EA is the ground-state energy of H in a bounded domain A with Dirichlet ($ = 0) boundary conditions. Our estimate f

A lower bound for partial list colorings

✍ Chappell, Glenn G. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

Let G be an n-vertex graph with list-chromatic number χ . Suppose that each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas [1] conjecture that at least t n /χ vertices can be colored from these lists. We prove a lower bound for the number of colorable vertices. As a coroll

A lower bound for groupies in graphs

✍ Mackey, John 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 2 views

A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the vertices in G. An isolated vertex is a groupie only if all vertices of G are isolated. While it is well known that every graph must contai

An upper bound for the ramsey number r(K

An upper bound for the ramsey number r(K5 − e)

✍ H. Harborth; I. Mengersen 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

A Lower Bound for the Shortest Path Prob

A Lower Bound for the Shortest Path Problem

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB