Hypergraphs: Combinatorics of Finite Sets

Author:   C. Berge
Publisher:   Elsevier Science & Technology
Edition:   3rd Revised edition
Volume:   v. 45
ISBN:  

9780444874894


Pages:   254
Publication Date:   04 August 1989
Format:   Hardback
Availability:   In Print   Availability explained
Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock.

Our Price $388.08 Quantity:  
Add to Cart

Share |

Hypergraphs: Combinatorics of Finite Sets


Add your own review!

Overview

Full Product Details

Author:   C. Berge
Publisher:   Elsevier Science & Technology
Imprint:   North-Holland
Edition:   3rd Revised edition
Volume:   v. 45
Dimensions:   Width: 15.60cm , Height: 1.70cm , Length: 23.40cm
Weight:   0.530kg
ISBN:  

9780444874894


ISBN 10:   0444874895
Pages:   254
Publication Date:   04 August 1989
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Out of Print
Availability:   In Print   Availability explained
Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock.

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.

Reviews

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


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


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


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List