✦ LIBER ✦

On a partition problem of Frobenius

✍ Scribed by J.S Byrnes

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 227 KB
Volume: 17
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90003-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a problem of Frobenius

✍ Pamela A Ferguson 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 518 KB

On a linear diophantine problem of Frobe

On a linear diophantine problem of Frobenius

✍ G.R. Hofmeister; A.M. Ibrahim; G.A. Shadia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 117 KB

On the Linear Diophantine Problem of Fro

On the Linear Diophantine Problem of Frobenius

✍ J.L. Davison 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Suppose \(a, b, c\) are three positive integers with \(\mathrm{gcd}=1\). We consider the function \(f(a, b, c)\) defined to be the largest integer not representable as a positive integral linear combination of \(a, b, c\). We give a new lower bound for \(f(a, b, c)\) which is shown to be tight, and

A Partition Problem

✍ J.W. Sander 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 458 KB

A relationship between certain colored g

A relationship between certain colored generalized Frobenius partitions and ordinary partitions

✍ Louis Worthy Kolitsch 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 162 KB

A note on a cycle partition problem

✍ Fengli Yang; Elkin Vumar 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Let G be any graph, and let c(G) denote the circumference of G. If, for every pair c 1 , c 2 of positive integers satisfying c 1 + c 2 = c(G), the vertex set of G admits a partition into two sets V 1 and V 2 such that V i induces a graph of circumference at most c i , i = 1, 2, then G is said to be