✦ LIBER ✦

Prime decompositions with minimum sum

✍ Scribed by Ole Østerby

Publisher: Springer Netherlands
Year: 1976
Tongue: English
Weight: 407 KB
Volume: 16
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932728

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Avoiding-sequences with minimum sum

✍ Dean S. Clark; James T. Lewis 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 360 KB

On sums with small prime factors

✍ G. N. Sárközy 📂 Article 📅 1995 🏛 Akadmiai Kiad 🌐 English ⚖ 455 KB

Sums over numbers with restricted prime

Sums over numbers with restricted prime factors

✍ Donald G. Hazlewood 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 532 KB

Coloring of trees with minimum sum of co

Coloring of trees with minimum sum of colors

✍ Jiang, Tao; West, Douglas B. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree with strength k that has maximum degree only 2k -2. The result

Sums over positive integers with few pri

Sums over positive integers with few prime factors

✍ D.G. Hazlewood 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 657 KB

Graph decomposition with constraints on

Graph decomposition with constraints on the minimum degree

✍ John Sheehan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Let G be a finite simple graph on n vertices with minimum degree 6(G) 3 6 (n = 6 (mod 2)). Let max(k, G) denote the set of all k-subsets A E V(G) such that the number of edges in the induced subgraph (A) is a maximum. We prove that for some i E (0, 1.2, . . . ). Analogous edge density constraints, r