✦ LIBER ✦

Partitions and pairwise sums and products

✍ Scribed by Neil Hindman

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 739 KB
Volume: 37
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(84)90018-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions and sums and products—Two cou

Partitions and sums and products—Two counterexamples

✍ Neil Hindman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 509 KB

Partitions and (m and n) sums of product

Partitions and (m and n) sums of products

✍ Gregory L Smith 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Exponential sums and rectangular partiti

Exponential sums and rectangular partitions

✍ A. Duane Porter; Nick Mousouris 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 456 KB

Minimal clique partitions and pairwise b

Minimal clique partitions and pairwise balanced designs

✍ Rolf Rees 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

We consider the problem of determining cp(G v KC), the smallest number of cliques required to partition the edge set of the graph G v K~, where G is a finite simple graph and K~, is the empty graph on m vertices. A lower bound on cp(G v K~,,,) is obtained which, when applied to the case G = K,, shar

Partitions and sums of integers with rep

Partitions and sums of integers with repetition

✍ Neil Hindman 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 880 KB

Largest and smallest maximal sets of pai

Largest and smallest maximal sets of pairwise disjoint partitions

✍ Melvyn B Nathanson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 314 KB