Extremal graph theory:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Mineola, NY
Dover Publications
2004
|
| Ausgabe: | unabridged republication |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XX, 488 S. Ill. u. graph. Darst. |
| ISBN: | 0486435962 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019619094 | ||
| 003 | DE-604 | ||
| 005 | 20221028 | ||
| 007 | t | ||
| 008 | 041203s2004 ad|| |||| 00||| eng d | ||
| 020 | |a 0486435962 |9 0-486-43596-2 | ||
| 035 | |a (OCoLC)54001494 | ||
| 035 | |a (DE-599)BVBBV019619094 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-11 |a DE-83 |a DE-634 |a DE-188 |a DE-739 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 511/.5 |2 22 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 100 | 1 | |a Bollobás, Béla |d 1943- |e Verfasser |0 (DE-588)109481240 |4 aut | |
| 245 | 1 | 0 | |a Extremal graph theory |
| 250 | |a unabridged republication | ||
| 264 | 1 | |a Mineola, NY |b Dover Publications |c 2004 | |
| 300 | |a XX, 488 S. |b Ill. u. graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Teoria dos grafos |2 larpcal | |
| 650 | 4 | |a Extremal problems (Mathematics) | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Extremalproblem |0 (DE-588)4439315-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Extremalproblem |0 (DE-588)4439315-5 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012948531&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-012948531 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804132982094561281 |
|---|---|
| adam_text | Contents Preface...............................................................................................................vii Basic Definitions..................................................................................................... xiii Chapter 1 : Connectivity............................................................................................... 1 1. Elementary Properties..................................................................................... 2 2. Menger’s Theorem and its Consequences........................................................ 7 3. The Structure of 2-and З-Connected Graphs..................................... 11 4. Minimally k-Connected Graphs.......................................................................... 17 5. Graphs with Given Maximal Local Connectivity............................................. 29 6. Exercises, Problems and Conjectures........................................................ 45 Chapter 2: Matching............................................................................................. 50 1. Fundamental Matching Theorems................................................................ 52 2. The Number of 1-Factors.................................................................................... 59 3. /-Factors ........... 67 4. Matching in Graphs with Restrictions on the Degrees .... 79 5. Coverings...................................................................................................... 90 6. Exercises, Problems and
Conjectures................................................................ 95 Chapter 3: Cycles..................................................................................................... 102 1. Graphs with Large Minimal Degree and LargeGirth .103 2. Vertex Disjoint Cycles.................................................................................. 110 3. Edge Disjoint Cycles.................................................................................. 119 4. The Circumference........................................................................................... 131 5. Graphs with Cycles of Given Lengths............................................................... 147 6. Exercises, Problems and Conjectures............................................................... 161 Chapter 4: The Diameter.................................................................................. 169 1. 2. 3. 4. 5. Diameter, Maximal Degree and Size............................................................... 170 Diameter and Connectivity......................................................................... 181 Graphs with Large Subgraphs of Small Diameter............................................ 194 Factors of Small Diameter.........................................................................206 Exercises, Problems and Conjectures............................................................... 213 xi
CONTENTS xii Chapter 5: Colourings....................................................................................................... 218 1. General Colouring Theorems........................................................................ 221 2. Critical k-Chromatic Graphs........................................................................ 234 3. Colouring Graphs on Surfaces........................................................................ 243 4. Sparse Graphs of Large Chromatic Number.............................................254 5. Perfect Graphs........................................................................... .263 6. Ramsey Type Theorems.................................................................................. 270 7. Exercises, Problems and Conjectures.............................................................. 280 ........ 292 1. The Number of Complete Subgraphs ......... ..................................................... 293 2. Complete Subgraphs of r-Partite Graphs..................................................... 309 3. The Structure of Graphs................................................................................. 327 4. The Structure of Extremal Graphs without Forbidden Subgraphs . . 339 5. Independent Complete Subgraphs...............................................................351 6. Exercises, Problems and Conjectures............................................................... 359 Chapter 6: Complete Subgraphs Chapter 7 : Topological
Subgraphs.................................................................................. 368 1. Contractions.....................................................................................................369 2. Topological Complete Subgraphs ....... 378 3. Semi-Topological Subgraphs........................................................................ 386 4. Exercises, Problems and Conjectures............................................................... 397 Chapters: Complexity and Packing.................................................................................. 401 1. 2. 3. 4. 5. 6. The Complexity of Graph Properties.............................................................. 402 MonotoneProperties................................................................................. 411 The Main Packing Theorem........................................................................ 418 Packing Graphs of Small Size........................................................................ 425 Applications of Packing Results to Complexity ..... 429 Exercises, Problems and Conjectures.............................................................. 434 References.............................................................................................................. 438 Index of Symbols ............................................................................................ 481 Index of Definitions........................................................ 485
|
| any_adam_object | 1 |
| author | Bollobás, Béla 1943- |
| author_GND | (DE-588)109481240 |
| author_facet | Bollobás, Béla 1943- |
| author_role | aut |
| author_sort | Bollobás, Béla 1943- |
| author_variant | b b bb |
| building | Verbundindex |
| bvnumber | BV019619094 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 170 SK 890 |
| classification_tum | MAT 055f |
| ctrlnum | (OCoLC)54001494 (DE-599)BVBBV019619094 |
| 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 |
| edition | unabridged republication |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01956nam a2200505 c 4500</leader><controlfield tag="001">BV019619094</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221028 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">041203s2004 ad|| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0486435962</subfield><subfield code="9">0-486-43596-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)54001494</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019619094</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bollobás, Béla</subfield><subfield code="d">1943-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109481240</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Extremal graph theory</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">unabridged republication</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Mineola, NY</subfield><subfield code="b">Dover Publications</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 488 S.</subfield><subfield code="b">Ill. u. graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Teoria dos grafos</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Extremal problems (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Extremalproblem</subfield><subfield code="0">(DE-588)4439315-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Extremalproblem</subfield><subfield code="0">(DE-588)4439315-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012948531&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012948531</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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.BV019619094 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:01:28Z |
| institution | BVB |
| isbn | 0486435962 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012948531 |
| oclc_num | 54001494 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-11 DE-83 DE-634 DE-188 DE-739 |
| owner_facet | DE-91G DE-BY-TUM DE-11 DE-83 DE-634 DE-188 DE-739 |
| physical | XX, 488 S. Ill. u. graph. Darst. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Dover Publications |
| record_format | marc |
| spelling | Bollobás, Béla 1943- Verfasser (DE-588)109481240 aut Extremal graph theory unabridged republication Mineola, NY Dover Publications 2004 XX, 488 S. Ill. u. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Teoria dos grafos larpcal Extremal problems (Mathematics) Graph theory Graph (DE-588)4021842-9 gnd rswk-swf Extremalproblem (DE-588)4439315-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Graph (DE-588)4021842-9 s 1\p DE-604 Extremalproblem (DE-588)4439315-5 s 2\p DE-604 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012948531&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Bollobás, Béla 1943- Extremal graph theory Teoria dos grafos larpcal Extremal problems (Mathematics) Graph theory Graph (DE-588)4021842-9 gnd Extremalproblem (DE-588)4439315-5 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4439315-5 (DE-588)4113782-6 |
| title | Extremal graph theory |
| title_auth | Extremal graph theory |
| title_exact_search | Extremal graph theory |
| title_full | Extremal graph theory |
| title_fullStr | Extremal graph theory |
| title_full_unstemmed | Extremal graph theory |
| title_short | Extremal graph theory |
| title_sort | extremal graph theory |
| topic | Teoria dos grafos larpcal Extremal problems (Mathematics) Graph theory Graph (DE-588)4021842-9 gnd Extremalproblem (DE-588)4439315-5 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Teoria dos grafos Extremal problems (Mathematics) Graph theory Graph Extremalproblem Graphentheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012948531&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bollobasbela extremalgraphtheory |