Skip to main content
Elsevier
View Cart
Your Account

Hypergraphs

Combinatorics of Finite Sets

  • 1st Edition, Volume 45 - May 1, 1984
  • Author: C. Berge
  • Language: English
  • Paperback ISBN:
    9 7 8 - 0 - 4 4 4 - 5 4 8 8 8 - 7
  • Hardback ISBN:
    9 7 8 - 0 - 4 4 4 - 8 7 4 8 9 - 4
  • eBook ISBN:
    9 7 8 - 0 - 0 8 - 0 8 8 0 2 3 - 5

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… Read more

Hypergraphs

Purchase options

LIMITED OFFER

Save 50% on book bundles

Immediately download your ebook while waiting for your print delivery. No promo code needed.

Image of books

Institutional subscription on ScienceDirect

Request a sales quote
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.