Mathematics of Ramsey theory:
Gespeichert in:
Weitere Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer-Verlag
1990
|
Schriftenreihe: | Algorithms and Combinatorics
5 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XIV, 269 Seiten |
ISBN: | 3540181911 0387181911 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV004254046 | ||
003 | DE-604 | ||
005 | 20210222 | ||
007 | t | ||
008 | 910311s1990 |||| 00||| engod | ||
020 | |a 3540181911 |9 3-540-18191-1 | ||
020 | |a 0387181911 |9 0-387-18191-1 | ||
035 | |a (OCoLC)22243396 | ||
035 | |a (DE-599)BVBBV004254046 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-91G |a DE-739 |a DE-824 |a DE-29T |a DE-703 |a DE-19 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
050 | 0 | |a QA166 | |
082 | 0 | |a 511/.5 |2 20 | |
084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a MAT 050f |2 stub | ||
084 | |a 05D10 |2 msc | ||
084 | |a 05-06 |2 msc | ||
245 | 1 | 0 | |a Mathematics of Ramsey theory |c Jaroslav Nešetřil ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer-Verlag |c 1990 | |
300 | |a XIV, 269 Seiten | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Algorithms and Combinatorics |v 5 | |
650 | 7 | |a NOMBRE RAMSEY |2 inriac | |
650 | 4 | |a Ramsey, Théorie de | |
650 | 7 | |a Ramsey, Théorie de |2 ram | |
650 | 7 | |a THEORIE RAMSEY |2 inriac | |
650 | 7 | |a hypergraphe |2 inriac | |
650 | 7 | |a théorie ergodique |2 inriac | |
650 | 7 | |a théorie graphe |2 inriac | |
650 | 7 | |a topologie |2 inriac | |
650 | 4 | |a Ramsey theory | |
650 | 0 | 7 | |a Ramsey-Theorie |0 (DE-588)4212682-4 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Ramsey-Theorie |0 (DE-588)4212682-4 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Nešetřil, Jaroslav |d 1946- |0 (DE-588)13380447X |4 edt | |
830 | 0 | |a Algorithms and Combinatorics |v 5 |w (DE-604)BV000617357 |9 5 | |
856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002646274&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
940 | 1 | |n oe | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002646274 |
Datensatz im Suchindex
_version_ | 1804118450293964800 |
---|---|
adam_text | Table of Contents
Introduction
Ramsey Theory Old and New 1
J. Nesetril and V. Rodl
1. Ramsey Numbers 2
2. Transfinite Ramsey Theory 3
3. Chromatic Number 3
4. Classical Theorems 3
5. Other Classical Theorems 4
6. Structural Generalizations 5
7. Infinite Ramsey Theorem 6
8. Unprovability Results 6
9. Non Standard Applications 7
Part I. Classics
Problems and Results on Graphs and Hypergraphs:
Similarities and Differences 12
P. Erdos
1. Extremal Problems of Turan Type 13
2. Density Problems 15
3. Ramsey s Theorem 17
4. Ramsey Turan Type Problems 22
5. Chromatic Numbers 25
Note on Canonical Partitions 29
R. Rado
XII Table of Contents
Part II. Numbers
On Size Ramsey Number of Paths, Trees and Circuits. II 34
J. Beck
1. Introduction 34
2. Proof of Theorem 1 Part One 36
3. Proof of Theorem 1 Part Two 40
4. Proof of Theorem 2 42
5. Proof of Theorem 3 44
On the Computational Complexity of Ramsey Type Problems 46
S.A. Burr
1. Introduction 46
2. iVP Complete Ramsey Problems 47
3. Polynomial Bounded Ramsey Problems 49
4. Discussion 51
Constructive Ramsey Bounds and Intersection Theorems for Sets 53
P. Frank}
1. Introduction 53
2. Families of Sets with Prescribed Intersections 54
3. The Proof of Theorem 2.3 55
4. The Proof of Theorem 1.1 55
Ordinal Types in Ramsey Theory and Well Partial Ordering Theory 57
I. Knz and R. Thomas
1. Introduction 58
2. Sheaves 61
3. Ramsey Systems 64
4. Well Partial Ordering 71
5. Erdos Szekeres Theorem 77
6. Ramsey Systems 85
7. Canonical Ramsey Theorem 92
Part III. Structural Theory
Partite Construction and Ramsey Space Systems 98
J. NeSetfU and V. Rodl
1. Introduction 98
2. Statement of Results 100
3. Partite Lemma 101
4. Partite Construction 106
5. Applications 108
Table of Contents XIII
Graham Rothschild Parameter Sets 113
H.J. Promel and B. Voigt
1. Introduction 113
2. Parameter Sets and Parameter Words (Definition and Basic Examples) 114
3. Hales Jewett s Theorem 117
4. Graham Rothschild s Theorem 128
5. Infinite Versions 136
6. Other Structures 143
Shelah s Proof of the Hales Jewett Theorem 150
A. Nilli
Part IV. Noncombinatorial Methods
Partitioning Topological Spaces 154
W. Weiss
1. Introduction 154
2. Partitioning Singletons 155
3. Partitioning Pairs 167
4. Open Problems 169
Topological Ramsey Theory 172
T.J. Carlson and S.G. Simpson
1. Introduction 172
2. Ramsey Spaces and Ellentuck s Theorem 173
3. Finitary Consequences of Ellentuck Type Theorems 176
4. The Axiom of Choice and the Construction of Non Ramsey Sets 177
5. Finite Dimensional Analogues of Ellentuck Type Theorems 179
6. Canonical Partitions 180
Ergodic Theory and Configurations in Sets of Positive Density 184
H. Fiirstenberg, Y. Katznelson and B. Weiss
1. Introduction 184
2. Correspondence Between Subsets of R and R Actions 185
3. Ergodic Averages for Subsets of R2 187
4. First Application to Subsets of Positive Density in R 188
5. Proof of Theorem A 189
6. A Recurrence Property of R2 Actions 191
7. Proof of Theorem B 197
XIV Table of Contents
Fart V. Variations and Applications
Topics in Euclidean Ramsey Theory 200
R.L. Graham
1. Introduction 200
2. Preliminaries 200
3. Ramsey Sets 202
4. Sphere Ramsey Sets 208
5. Concluding Remarks 211
On Pisier Type Problems and Results
(Combinatorial Applications to Number Theory) 214
P. Erdos, J. NeSetfil and V. Rodl
1. Introduction 214
2. Multiplicative Bases and Szemer^di Ruzsa Theorem 217
3. Graphical Sequences and Examples of Their Use 221
4. Pisier Type Theorems 224
5. Pisier Problem Positive Results 227
6. Special Ramsey Graphs the Partite Construction 228
Combinatorial Statements Independent of Arithmetic 232
J. Paris
1. Introduction 232
2. Notation 233
3. Arithmetic 235
4. Conclusions 244
Boolean Complexity and Ramsey Theorems 246
P. Pudlik
1. General Remarks 246
2. An Example of a Lower Bound to Formula Size Complexity 248
Uncrowded Graphs 253
J. Spencer
1. Graphs 253
2. Hypergraphs 258
3. Heilbronn s Conjecture 259
Author Index 263
Subject Index 267
|
any_adam_object | 1 |
author2 | Nešetřil, Jaroslav 1946- |
author2_role | edt |
author2_variant | j n jn |
author_GND | (DE-588)13380447X |
author_facet | Nešetřil, Jaroslav 1946- |
building | Verbundindex |
bvnumber | BV004254046 |
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 050f |
ctrlnum | (OCoLC)22243396 (DE-599)BVBBV004254046 |
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 | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01935nam a2200541 cb4500</leader><controlfield tag="001">BV004254046</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210222 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910311s1990 |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540181911</subfield><subfield code="9">3-540-18191-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387181911</subfield><subfield code="9">0-387-18191-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22243396</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004254046</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-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</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">20</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 050f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05D10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematics of Ramsey theory</subfield><subfield code="c">Jaroslav Nešetřil ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer-Verlag</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 269 Seiten</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="490" ind1="1" ind2=" "><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">5</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">NOMBRE RAMSEY</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ramsey, Théorie de</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ramsey, Théorie de</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">THEORIE RAMSEY</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">hypergraphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie ergodique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">topologie</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ramsey theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ramsey-Theorie</subfield><subfield code="0">(DE-588)4212682-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Ramsey-Theorie</subfield><subfield code="0">(DE-588)4212682-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nešetřil, Jaroslav</subfield><subfield code="d">1946-</subfield><subfield code="0">(DE-588)13380447X</subfield><subfield code="4">edt</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">5</subfield><subfield code="w">(DE-604)BV000617357</subfield><subfield code="9">5</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</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=002646274&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="n">oe</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002646274</subfield></datafield></record></collection> |
id | DE-604.BV004254046 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T16:10:29Z |
institution | BVB |
isbn | 3540181911 0387181911 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002646274 |
oclc_num | 22243396 |
open_access_boolean | |
owner | DE-12 DE-91G DE-BY-TUM DE-739 DE-824 DE-29T DE-703 DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 |
owner_facet | DE-12 DE-91G DE-BY-TUM DE-739 DE-824 DE-29T DE-703 DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 |
physical | XIV, 269 Seiten |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | Springer-Verlag |
record_format | marc |
series | Algorithms and Combinatorics |
series2 | Algorithms and Combinatorics |
spelling | Mathematics of Ramsey theory Jaroslav Nešetřil ... (eds.) Berlin [u.a.] Springer-Verlag 1990 XIV, 269 Seiten txt rdacontent n rdamedia nc rdacarrier Algorithms and Combinatorics 5 NOMBRE RAMSEY inriac Ramsey, Théorie de Ramsey, Théorie de ram THEORIE RAMSEY inriac hypergraphe inriac théorie ergodique inriac théorie graphe inriac topologie inriac Ramsey theory Ramsey-Theorie (DE-588)4212682-4 gnd rswk-swf Ramsey-Theorie (DE-588)4212682-4 s DE-604 Nešetřil, Jaroslav 1946- (DE-588)13380447X edt Algorithms and Combinatorics 5 (DE-604)BV000617357 5 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002646274&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Mathematics of Ramsey theory Algorithms and Combinatorics NOMBRE RAMSEY inriac Ramsey, Théorie de Ramsey, Théorie de ram THEORIE RAMSEY inriac hypergraphe inriac théorie ergodique inriac théorie graphe inriac topologie inriac Ramsey theory Ramsey-Theorie (DE-588)4212682-4 gnd |
subject_GND | (DE-588)4212682-4 |
title | Mathematics of Ramsey theory |
title_auth | Mathematics of Ramsey theory |
title_exact_search | Mathematics of Ramsey theory |
title_full | Mathematics of Ramsey theory Jaroslav Nešetřil ... (eds.) |
title_fullStr | Mathematics of Ramsey theory Jaroslav Nešetřil ... (eds.) |
title_full_unstemmed | Mathematics of Ramsey theory Jaroslav Nešetřil ... (eds.) |
title_short | Mathematics of Ramsey theory |
title_sort | mathematics of ramsey theory |
topic | NOMBRE RAMSEY inriac Ramsey, Théorie de Ramsey, Théorie de ram THEORIE RAMSEY inriac hypergraphe inriac théorie ergodique inriac théorie graphe inriac topologie inriac Ramsey theory Ramsey-Theorie (DE-588)4212682-4 gnd |
topic_facet | NOMBRE RAMSEY Ramsey, Théorie de THEORIE RAMSEY hypergraphe théorie ergodique théorie graphe topologie Ramsey theory Ramsey-Theorie |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002646274&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000617357 |
work_keys_str_mv | AT nesetriljaroslav mathematicsoframseytheory |