Hypergraphs [electronic resource] : combinatorics of finite sets / Claude Berge.
Material type:
TextLanguage: engfre Series: North-Holland mathematical library ; v. 45.Publication details: Amsterdam ; New York : North Holland : Distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1989. Description: 1 online resource (ix, 255 p.)ISBN: 9780444874894; 0444874895Uniform titles: Hypergraphes. English Subject(s): Hypergraphs | HypergraphsGenre/Form: Electronic books.Additional physical formats: Print version:: Hypergraphs.DDC classification: 511/.5 LOC classification: QA166.23 | .B4813 1989ebOnline resources: ScienceDirect | Volltext Summary: 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 Tu�rn and �Knig. 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.
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 Tu�rn and �Knig. 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.
Translation of: Hypergraphes.
Includes bibliographical references (p. [237]-255).
Description based on print version record.
There are no comments on this title.