✦ LIBER ✦

Some covering and packing results in number theory

✍ Scribed by G. Weinstein

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 528 KB
Volume: 8
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(76)90101-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The covering number in learning theory

✍ Ding-Xuan Zhou 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Covering and packing in graphs IV: Linea

Covering and packing in graphs IV: Linear arboricity

✍ Jin Akiyama; Geoffrey Exoo; Frank Harary 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

New results on GDDs, covering, packing a

New results on GDDs, covering, packing and directable designs with block size 5

✍ R. Julian R. Abel; Ahmed M. Assaf; Iliya Bluskov; Malcolm Greig; Nabil Shalaby 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

## Abstract This article looks at (5,λ) GDDs and (__v__,5,λ) pair packing and pair covering designs. For packing designs, we solve the (4__t__,5,3) class with two possible exceptions, solve 16 open cases with λ odd, and improve the maximum number of blocks in some (__v__, 5, λ) packings when __v__

Covering and packing in graphs—V: Mispac

Covering and packing in graphs—V: Mispacking subcubes in hypercubes

✍ Niall Graham; Frank Harary 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Some extremal results in cochromatic and

Some extremal results in cochromatic and dichromatic theory

✍ Paul Erdös; John Gimbel; Dieter Kratsch 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

## Abstract For a graph __G__, the cochromatic number of __G__, denoted __z__(__G__), is the least __m__ for which there is a partition of the vertex set of __G__ having order __m__. where each part induces a complete or empty graph. We show that if {__G__~__n__~} is a family of graphs where __G__

Some results on the achromatic number

✍ Cairnie, Niall; Edwards, Keith 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ( k 2 ) ≤ m. We show that the problem of dete