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: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English French |
| Published: |
Amsterdam ; New York :
North Holland : Distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1989.
|
| Series: | North-Holland mathematical library ;
v. 45. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
MARC
| Tag | First Indicator | Second Indicator | Subfields |
|---|---|---|---|
| LEADER | 00000cam a2200000 a 4500 | ||
| 001 | in00005737101 | ||
| 005 | 20260326161334.9 | ||
| 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 |d OCLCL | ||
| 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 | ||
| 037 | |a 119955:123213 |b Elsevier Science & Technology |n http://www.sciencedirect.com | ||
| 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 |
| 049 | |a TXAM | ||
| 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 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. | ||
| 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. | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 650 | 7 | |a Hypergraphs |2 fast | |
| 653 | |a Graph theory | ||
| 655 | 7 | |a Electronic books. |2 local | |
| 710 | 2 | |a ScienceDirect (Online service) | |
| 758 | |i has work: |a Hypergraphs (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGBWtwyYx7fCdc8t3vY4HK |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 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 http://proxy.library.tamu.edu/login?url=https://www.sciencedirect.com/science/bookseries/09246509/45 |z Connect to the full text of this electronic book |t 0 |
| 955 | |a Elsevier ScienceDirect 2026-2027 | ||
| 994 | |a 92 |b TXA | ||
| 999 | f | f | |i dbcd0cbd-5f2f-4358-8c62-ebe61f2a0c25 |s 95d11cd0-c22d-4234-b1f2-59ed8febea6e |t 0 |
| 952 | f | f | |a Texas A&M University |b College Station |c Electronic Resources |s www_evans |d Available Online |t 0 |e QA166.23 .B4813 1989eb |h Library of Congress classification |
| 998 | f | f | |a QA166.23 .B4813 1989eb |t 0 |l Available Online |