Hypergraphs: Combinatorics of Finite Sets (North-Holland Mathematical Library) Book + PRICE WATCH * Amazon pricing is not included in price watch

Hypergraphs: Combinatorics of Finite Sets (North-Holland Mathematical Library) Book

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.Read More

from£N/A | RRP: £88.99
* Excludes Voucher Code Discount Also available Used from £N/A
  • 0444874895
  • 9780444874894
  • C. Berge
  • 4 August 1989
  • North Holland
  • Hardcover (Book)
  • 256
  • 3rd Revised edition
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.