Hypergraphs
Combinatorics of Finite Sets
- 1st Edition, Volume 45 - May 1, 1984
- Imprint: North Holland
- Author: C. Berge
- Language: English
- Hardback ISBN:9 7 8 - 0 - 4 4 4 - 8 7 4 8 9 - 4
- Paperback ISBN:9 7 8 - 0 - 4 4 4 - 5 4 8 8 8 - 7
- eBook ISBN:9 7 8 - 0 - 0 8 - 0 8 8 0 2 3 - 5
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… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteGraph 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.
1. General Concepts. Dual Hypergraphs. Degrees. Intersecting Families. The Coloured Edge Property and Chvátal's Conjecture. The Helly Property. Section of a Hypergraph and the Kruskal-Katona Theorem. Conformal Hypergraphs. Representative Graphs.
2. Transversal Sets and Matchings. Transversal Hypergraphs. The Coefficients r and r'. r-Critical Hypergraphs. The König Property.
3. Fractional Transversals. Fractional Transversal Number. Fractional Matching of a Graph. Fractional Transversal Number of a Regularisable Hypergraph. Greedy Transversal Number. Ryser's Conjecture. Transversal Number of Product Hypergraphs.
4. Colourings. Chromatic Number. Particular Kinds of Colourings. Uniform Colourings. Extremal Problems Related to the Chromatic Number. Good Edge-Colourings of a Complete Hypergraph. An Application to an Extremal Problem. Kneser's Problem.
5. Hypergraphs Generalising Bipartite Graphs. Hypergraphs without Odd Cycles. Unimodular Hypergraphs. Balanced Hypergraphs. Arboreal Hypergraphs. Normal Hypergraphs. Mengerian Hypergraphs. Paranormal Hypergraphs.
Appendix: Matchings and Colourings in Matroids.
References.
- Edition: 1
- Volume: 45
- Published: May 1, 1984
- Imprint: North Holland
- No. of pages: 254
- Language: English
- Hardback ISBN: 9780444874894
- Paperback ISBN: 9780444548887
- eBook ISBN: 9780080880235
Read Hypergraphs on ScienceDirect