Hypergraphs - 1st Edition - ISBN: 9780444874894, 9780080880235

Hypergraphs, Volume 45

1st Edition

Combinatorics of Finite Sets

Authors: C. Berge
eBook ISBN: 9780080880235
Hardcover ISBN: 9780444874894
Imprint: North Holland
Published Date: 4th August 1989
Page Count: 254
Tax/VAT will be calculated at check-out
30% off
30% off
30% off
30% off
30% off
20% off
20% off
25% off
25% off
25% off
25% off
25% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
72.95
51.06
51.06
51.06
51.06
51.06
58.36
58.36
17100.00
12825.00
12825.00
12825.00
12825.00
12825.00
13680.00
13680.00
43.99
30.79
30.79
30.79
30.79
30.79
35.19
35.19
155.00
108.50
108.50
108.50
108.50
108.50
124.00
124.00
54.95
38.47
38.47
38.47
38.47
38.47
43.96
43.96
Unavailable
DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents

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.


Description

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.


Details

No. of pages:
254
Language:
English
Copyright:
© North Holland 1989
Published:
Imprint:
North Holland
eBook ISBN:
9780080880235
Hardcover ISBN:
9780444874894

Reviews

@qu:This book presents what seems to be the most significant work on hypergraphs. @source:L'Enseignement Mathematique


About the Authors

C. Berge Author