Mathematics of Ramsey Theory: Algorithms and Combinatorics, cartea 5
Editat de Jaroslav Nesetril, Vojtech Rödlen Limba Engleză Paperback – 25 feb 2012
Din seria Algorithms and Combinatorics
- 18% Preț: 1100.89 lei
- 24% Preț: 912.87 lei
- Preț: 379.59 lei
- Preț: 383.74 lei
- 15% Preț: 626.15 lei
- 15% Preț: 644.92 lei
- 18% Preț: 945.79 lei
- 15% Preț: 636.09 lei
- 18% Preț: 765.19 lei
- 18% Preț: 931.71 lei
- 18% Preț: 934.02 lei
- 18% Preț: 879.44 lei
- Preț: 501.87 lei
- 15% Preț: 625.98 lei
- 18% Preț: 879.44 lei
- 18% Preț: 959.86 lei
- 18% Preț: 947.61 lei
- 20% Preț: 500.19 lei
- 15% Preț: 581.10 lei
- Preț: 391.47 lei
- 15% Preț: 631.14 lei
- 18% Preț: 952.72 lei
- Preț: 378.26 lei
- 15% Preț: 577.25 lei
- 15% Preț: 643.15 lei
- Preț: 373.76 lei
Preț: 629.52 lei
Preț vechi: 740.61 lei
-15% Nou
Puncte Express: 944
Preț estimativ în valută:
120.52€ • 125.27$ • 99.92£
120.52€ • 125.27$ • 99.92£
Carte tipărită la comandă
Livrare economică 06-20 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642729072
ISBN-10: 364272907X
Pagini: 292
Ilustrații: XIV, 269 p.
Dimensiuni: 170 x 242 x 15 mm
Greutate: 0.48 kg
Ediția:Softcover reprint of the original 1st ed. 1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 364272907X
Pagini: 292
Ilustrații: XIV, 269 p.
Dimensiuni: 170 x 242 x 15 mm
Greutate: 0.48 kg
Ediția:Softcover reprint of the original 1st ed. 1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Ramsey Theory Old and New.- 1. Ramsey Numbers.- 2. Transfinite Ramsey Theory.- 3. Chromatic Number.- 4. Classical Theorems.- 5. Other Classical Theorems.- 6. Structural Generalizations.- 7. Infinite Ramsey Theorem.- 8. Unprovability Results.- 9. Non-Standard Applications.- I. Classics.- Problems and Results on Graphs and Hypergraphs: Similarities and Differences.- Note on Canonical Partitions.- II. Numbers.- On Size Ramsey Number of Paths, Trees and Circuits. II.- On the Computational Complexity of Ramsey-Type Problems.- Constructive Ramsey Bounds and Intersection Theorems for Sets.- Ordinal Types in Ramsey Theory and Well-Partial-Ordering Theory.- III. Structural Theory.- Partite Construction and Ramsey Space Systems.- Graham-Rothschild Parameter Sets.- Shelah’s Proof of the Hales-Jewett Theorem.- IV. Noncombinatorial Methods.- Partitioning Topological Spaces.- Topological Ramsey Theory.- Ergodic Theory and Configurations in Sets of Positive Density.- V. Variations and Applications.-Topics in Euclidean Ramsey Theory.- On Pisier Type Problems and Results (Combinatorial Applications to Number Theory).- Combinatorial Statements Independent of Arithmetic.- Boolean Complexity and Ramsey Theorems.- Uncrowded Graphs.- Author Index.