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...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Amsterdam
North Holland
1989, 1989
|
| Series: | North-Holland mathematical library
|
| Subjects: | |
| Online Access: | |
| Collection: | Elsevier eBook collection Mathematics - Collection details see MPG.ReNa |
Table of Contents:
- Front Cover; Hypergraphs: Combinatorics of Finite Sets; Copyright Page; Table of Contents; Chapter 1. General concepts; Chapter 2. Transversal sets and matchings; Chapter 3. Fractional transversals; Chapter 4. Colourings; Chapter 5. Hypergraphs generalising bipartite graphs; Appendix: Matching and colourings in matroids; References
- Includes bibliographical references (pages 237-255)