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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Berge, Claude
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

MARC

LEADER 00000cam a2200000 a 4500
001 SCIDIR_ocn316566673
003 OCoLC
005 20231117015238.0
006 m o d
007 cr cn|||||||||
008 090320s1989 ne ob 000 0 eng d
040 |a OPELS  |b eng  |e pn  |c OPELS  |d OPELS  |d OCLCQ  |d OCLCF  |d OCLCO  |d DEBBG  |d N$T  |d YDXCP  |d IDEBK  |d E7B  |d MERUC  |d OCLCQ  |d COO  |d OCLCQ  |d LVB  |d DEBSZ  |d S2H  |d OCLCO  |d OCLCQ  |d UKAHL  |d OCLCQ  |d INARC  |d OCLCO 
019 |a 298129583  |a 646756778 
020 |a 9780444874894 
020 |a 0444874895 
020 |a 9780080558011  |q (electronic bk.) 
020 |a 0080558011  |q (electronic bk.) 
035 |a (OCoLC)316566673  |z (OCoLC)298129583  |z (OCoLC)646756778 
041 0 |a eng  |a fre 
050 4 |a QA166.23  |b .B4813 1989eb 
072 7 |a MAT  |x 013000  |2 bisacsh 
082 0 4 |a 511/.5  |2 22 
100 1 |a Berge, Claude. 
240 1 0 |a Hypergraphes.  |l English 
245 1 0 |a Hypergraphs :  |b combinatorics of finite sets /  |c Claude Berge. 
260 |a Amsterdam ;  |a New York :  |b North Holland :  |b Distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,  |c 1989. 
300 |a 1 online resource (ix, 255 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a North-Holland mathematical library ;  |v v. 45 
520 |a 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. 
500 |a Translation of: Hypergraphes. 
504 |a Includes bibliographical references (pages 237-255). 
588 0 |a Print version record. 
505 0 |a 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. 
650 0 |a Hypergraphs. 
650 6 |a Hypergraphes.  |0 (CaQQLa)201-0024316 
650 7 |a MATHEMATICS  |x Graphic Methods.  |2 bisacsh 
650 7 |a Hypergraphs  |2 fast  |0 (OCoLC)fst00965761 
653 |a Graph theory 
776 0 8 |i Print version:  |a Berge, Claude.  |s Hypergraphes. English.  |t Hypergraphs.  |d Amsterdam ; New York : North Holland : Distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1989  |z 0444874895  |z 9780444874894  |w (DLC) 89011848  |w (OCoLC)19888168 
830 0 |a North-Holland mathematical library ;  |v v. 45. 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/book/9780444874894  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/publication?issn=09246509&volume=45  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/bookseries/09246509/45  |z Texto completo