Cargando…
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 combinator...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés Francés |
| Publicado: |
Amsterdam ; New York :
North Holland : Distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1989.
|
| Colección: | North-Holland mathematical library ;
v. 45. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
| Sumario: | 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. |
|---|---|
| Notas: | Translation of: Hypergraphes. |
| Descripción Física: | 1 online resource (ix, 255 pages) |
| Bibliografía: | Includes bibliographical references (pages 237-255). |
| ISBN: | 9780444874894 0444874895 9780080558011 0080558011 |