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 Turan and Konig. 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.

• ISBN: 0444874895
• ISBN-13: 9780444874894
• Authors : Claude Berge and C. Berge and Berge
• Category : Mathematics - Graphic Methods
• Language : English
• Format:  Hardcover
• Publication Date: 8/1/1989
• Publisher Imprint: North-Holland
• Price ($AUD): $311.95


• Usual Dispatch Time: 7 - 10 days

• Please note that all prices are in Australian dollars
• Some titles may be subject to availability