Hypergraphs: Combinatorics of Finite Sets by C. Berge

Hypergraphs: Combinatorics of Finite Sets

byC. Berge

Kobo ebook | May 1, 1984

Pricing and Purchase Info

$64.79 online 
$81.00 list price save 20%

Prices and offers may vary in store

Available for download

Not available in stores


Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets from this standpoint took shape around 1960. In regarding each set as a ``generalised edge' and in calling the family itself a ``hypergraph', the initial idea was to try to extend certain classical results of Graph Theory such as the theorems of Turán and König. It was noticed that this generalisation often led to simplification; moreover, one single statement, sometimes remarkably simple, could unify several theorems on graphs. This book presents what seems to be the most significant work on hypergraphs.

Title:Hypergraphs: Combinatorics of Finite SetsFormat:Kobo ebookPublished:May 1, 1984Publisher:Elsevier ScienceLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0080880231

ISBN - 13:9780080880235