✦ LIBER ✦

Upper bounds for p-divisibility of sets of Bernoulli numbers

✍ Scribed by Stephen V Ullom

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 197 KB
Volume: 12
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(80)90053-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

p-adic Proofs of congruences for the Ber

p-adic Proofs of congruences for the Bernoulli numbers

✍ Wells Johnson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 655 KB

An upper bound for the average number of

An upper bound for the average number of regions

✍ Saul Stahl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 190 KB

New upper bounds for the chromatic numbe

New upper bounds for the chromatic number of a graph

✍ Ladislav Stacho 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB 👁 3 views

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

An Upper Bound for the Number of Treatme

An Upper Bound for the Number of Treatments Common to any Set of Blocks of Certain PBIB Designs

✍ S. M. Shah; Dr. D. G. Kabe 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 351 KB 👁 3 views

An upper bound for the harmonious chroma

An upper bound for the harmonious chromatic number of a graph

✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o