Hypergraphs: combinatorics of finite sets
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English French |
| Veröffentlicht: |
Amsterdam
North Holland
1989
|
| Schriftenreihe: | North-Holland mathematical library
v. 45 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Translation of: Hypergraphes 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 Ḵ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 Includes bibliographical references (p. [237]-255) |
| Beschreibung: | 1 Online-Ressource (ix, 255 p.) |
| ISBN: | 9780444874894 0444874895 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042317579 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150129s1989 |||| o||u| ||||||eng d | ||
| 020 | |a 9780444874894 |9 978-0-444-87489-4 | ||
| 020 | |a 0444874895 |9 0-444-87489-5 | ||
| 035 | |a (ZDB-33-EBS)ocn316566673 | ||
| 035 | |a (OCoLC)316566673 | ||
| 035 | |a (DE-599)BVBBV042317579 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng |a fre | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511/.5 |2 22 | |
| 100 | 1 | |a Berge, Claude |e Verfasser |4 aut | |
| 240 | 1 | 0 | |a Hypergraphes |
| 245 | 1 | 0 | |a Hypergraphs |b combinatorics of finite sets |c Claude Berge |
| 264 | 1 | |a Amsterdam |b North Holland |c 1989 | |
| 300 | |a 1 Online-Ressource (ix, 255 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a North-Holland mathematical library |v v. 45 | |
| 500 | |a Translation of: Hypergraphes | ||
| 500 | |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 Ḵ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 Includes bibliographical references (p. [237]-255) | ||
| 650 | 7 | |a Hypergraphs |2 fast | |
| 650 | 4 | |a Hypergraphs | |
| 650 | 0 | 7 | |a Hypergraph |0 (DE-588)4161063-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Hypergraph |0 (DE-588)4161063-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780444874894 |x Verlag |3 Volltext |
| 912 | |a ZDB-33-ESD |a ZDB-33-EBS | ||
| 940 | 1 | |q FAW_PDA_ESD | |
| 940 | 1 | |q FLA_PDA_ESD | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027754570 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804152914155929600 |
|---|---|
| any_adam_object | |
| author | Berge, Claude |
| author_facet | Berge, Claude |
| author_role | aut |
| author_sort | Berge, Claude |
| author_variant | c b cb |
| building | Verbundindex |
| bvnumber | BV042317579 |
| collection | ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (ZDB-33-EBS)ocn316566673 (OCoLC)316566673 (DE-599)BVBBV042317579 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02403nmm a2200469zcb4500</leader><controlfield tag="001">BV042317579</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150129s1989 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780444874894</subfield><subfield code="9">978-0-444-87489-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444874895</subfield><subfield code="9">0-444-87489-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-EBS)ocn316566673</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)316566673</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042317579</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield><subfield code="a">fre</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Berge, Claude</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Hypergraphes</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Hypergraphs</subfield><subfield code="b">combinatorics of finite sets</subfield><subfield code="c">Claude Berge</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">North Holland</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (ix, 255 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">North-Holland mathematical library</subfield><subfield code="v">v. 45</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Translation of: Hypergraphes</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="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 Ḵ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</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. [237]-255)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Hypergraphs</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypergraphs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780444874894</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FAW_PDA_ESD</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FLA_PDA_ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027754570</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042317579 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:18:17Z |
| institution | BVB |
| isbn | 9780444874894 0444874895 |
| language | English French |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027754570 |
| oclc_num | 316566673 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 Online-Ressource (ix, 255 p.) |
| psigel | ZDB-33-ESD ZDB-33-EBS FAW_PDA_ESD FLA_PDA_ESD |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | North Holland |
| record_format | marc |
| series2 | North-Holland mathematical library |
| spelling | Berge, Claude Verfasser aut Hypergraphes Hypergraphs combinatorics of finite sets Claude Berge Amsterdam North Holland 1989 1 Online-Ressource (ix, 255 p.) txt rdacontent c rdamedia cr rdacarrier North-Holland mathematical library v. 45 Translation of: Hypergraphes 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 Ḵ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 Includes bibliographical references (p. [237]-255) Hypergraphs fast Hypergraphs Hypergraph (DE-588)4161063-5 gnd rswk-swf Hypergraph (DE-588)4161063-5 s 1\p DE-604 http://www.sciencedirect.com/science/book/9780444874894 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Berge, Claude Hypergraphs combinatorics of finite sets Hypergraphs fast Hypergraphs Hypergraph (DE-588)4161063-5 gnd |
| subject_GND | (DE-588)4161063-5 |
| title | Hypergraphs combinatorics of finite sets |
| title_alt | Hypergraphes |
| title_auth | Hypergraphs combinatorics of finite sets |
| title_exact_search | Hypergraphs combinatorics of finite sets |
| title_full | Hypergraphs combinatorics of finite sets Claude Berge |
| title_fullStr | Hypergraphs combinatorics of finite sets Claude Berge |
| title_full_unstemmed | Hypergraphs combinatorics of finite sets Claude Berge |
| title_short | Hypergraphs |
| title_sort | hypergraphs combinatorics of finite sets |
| title_sub | combinatorics of finite sets |
| topic | Hypergraphs fast Hypergraphs Hypergraph (DE-588)4161063-5 gnd |
| topic_facet | Hypergraphs Hypergraph |
| url | http://www.sciencedirect.com/science/book/9780444874894 |
| work_keys_str_mv | AT bergeclaude hypergraphes AT bergeclaude hypergraphscombinatoricsoffinitesets |