Hypergraphs: combinatorics of finite sets
 |
|
Описание:
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.Похожие книги
 | Augustin-Louis Cauchy Год: 2011 |
 | Cyclic homology in non-commutative geometry Автор: Joachim Cuntz Год: 2004 |
| Regular variation Автор: N. H. Bingham Год: 1987 |
| Random Walk in Random and Non-Random Environments Автор: Pal Revesz Год: 2005 |
| Strong Limit Theorems in Noncommutative L2-spaces Автор: Ryszard Jajte Год: 1991 |
| Origamics: mathematical explorations through paper folding Автор: Kazuo Haga Год: 2008 |