Summary and Info
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.
More About the Author
Bertelsmann is a multinational corporation based in Gütersloh, North Rhine-Westphalia, Germany. It is one of the world's largest mass media companies and also active in the service sector and education.
Review and Comments
Rate the Book
Hypergraphs: combinatorics of finite sets 0 out of 5 stars based on 0 ratings.