𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Hypergraphs: combinatorics of finite sets

✍ Scribed by C. Berge

Publisher
Elsevier, Academic Press
Year
1989
Tongue
English
Leaves
267
Series
North-Holland Mathematical Library 45
Edition
1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

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 ahypergraph'', 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 VOLUMES

Hypergraphs: combinatorics of finite set
πŸ“ Hypergraphs: combinatorics of finite sets
✍ C. Berge πŸ“‚ Library πŸ“… 1989 πŸ› North Holland 🌐 English

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 combinator

Combinatorics: Set Systems, Hypergraphs,
πŸ“ Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability
✍ Bela Bollobas πŸ“‚ Library πŸ“… 1996 πŸ› Cambridge University Press 🌐 English

Combinatorics is a book whose main theme is the study of subsets of a finite set. It gives a thorough grounding in the theories of set systems and hypergraphs, while providing an introduction to matroids, designs, combinatorial probability and Ramsey theory for infinite sets. The gems of the theory

Combinatorics: Set Systems, Hypergraphs,
πŸ“ Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics
✍ BΓ©la BollobΓ‘s πŸ“‚ Library πŸ“… 1990 πŸ› Cambridge University Press 🌐 English

Combinatorics is a book whose main theme is the study of subsets of a finite set. It gives a thorough grounding in the theories of set systems and hypergraphs, while providing an introduction to matroids, designs, combinatorial probability and Ramsey theory for infinite sets. The gems of the theory

Combinatorics of Finite Sets
πŸ“ Combinatorics of Finite Sets
✍ Ian Anderson πŸ“‚ Library πŸ“… 2002 πŸ› Dover Publications Inc. 🌐 English

Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result concerning k-saturated chain partitions of general p