ENGLISH

Hypergraphs: combinatorics of finite sets

By C. Berge

Book information

Publisher
North Holland
Year
1989
ISBN
0444874895, 9780444874894, 9780080558011
LCC
QA166.23 .B4813 1989
Open Library ID
OL2192994M
Language
english
Format
DJVU
Filesize
2 MB (1750837 bytes)
Series
NHML045
Edition
1
Pages
265\265
Library
Kolxo3
DPI
600
Orientation
yes
Scanned
yes
Time added
2010-07-29 05:14:56

Description

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.

Similar books