![]() |
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
||
Showing 1 - 2 of 2 matches in All Departments
In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact. This volume includes contributions to these and other topics from many of the participants.
During the early part of the last century, Ferdinand Georg
Frobenius (1849-1917) raised the following problem, known as the
Frobenius Problem (FP): given relatively prime positive integers
a1,, an, find the largest natural number (called the Frobenius
number and denoted by g(a1,, an) that is not representable as a
nonnegative integer combination of a1,, an.
|
You may like...
|