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ț: 1123.67 lei
- Preț: 387.38 lei
- Preț: 391.61 lei
- 15% Preț: 639.08 lei
- 15% Preț: 658.22 lei
- 18% Preț: 965.34 lei
- 15% Preț: 649.22 lei
- 18% Preț: 781.00 lei
- 18% Preț: 950.96 lei
- 18% Preț: 953.35 lei
- 18% Preț: 897.65 lei
- Preț: 512.18 lei
- 15% Preț: 638.89 lei
- 18% Preț: 897.65 lei
- 24% Preț: 912.87 lei
- 18% Preț: 979.70 lei
- 18% Preț: 967.22 lei
- 20% Preț: 500.19 lei
- 15% Preț: 593.08 lei
- Preț: 399.50 lei
- 15% Preț: 644.18 lei
- 18% Preț: 972.42 lei
- Preț: 386.00 lei
- 15% Preț: 589.14 lei
- 15% Preț: 656.43 lei
- Preț: 381.43 lei
Preț: 642.51 lei
Preț vechi: 755.88 lei
-15% Nou
Puncte Express: 964
Preț estimativ în valută:
122.97€ • 128.04$ • 103.92£
122.97€ • 128.04$ • 103.92£
Carte tipărită la comandă
Livrare economică 10-24 martie
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.