free shipping on orders over $35*
BUYBACK CART Buyback Cart Total Buyback Cart Total
free shipping on buybacks!

    Ramsey Theory Yesterday, Today, and Tomorrow

    ISBN-10: 0817680918
    ISBN-13: 9780817680916
    Author(s): Alexander Soifer
    Buy it from: $54.74
    This item will ship on Thursday, April 2.

    The first one is FREE! All the information you need in one place—a topical tool kit in digital form. Through June 15, 2015, add a Study Brief to your cart with a book purchase or rental and the discount will be applied at checkout.
    Study Briefs
    Calculus 1
    Digital only List price: $1.99
    Study Briefs
    Medical Abbreviations & Acronyms
    Digital only List price: $1.99
    Study Briefs
    Medical Terminology
    Digital only List price: $1.99
    Study Briefs
    Medical Math
    Digital only List price: $1.99
    Customers Also Bought

    List Price: $99.00
    Publisher: Birkhauser Verlag GmbH
    Binding: Hardcover
    Pages: 190
    Size: 6.50" wide x 9.75" long x 0.75" tall
    Weight: 1.012
    Language: English

    What This Book is About and How it Came into Being
    Ramsey Theory Before Ramsey, Prehistory and Early History: An Essay in 13 Parts
    David Hilbert's 1892 Cube Lemma
    The Issai Schur 1916 Theorem
    The Baudet-Schur-Van der Waerden 1927 Theorem
    The Generalized 1928 Schur Theorem
    The Frank Plumpton Ramsey Principle
    The Paul, Gj�rgy, and Esther Happy End Problem
    Richard Rado's Regularity
    Density and Arithmetic Progressions
    The Tibor Gallai Theorem
    De Bruijn-Erdos's 1951 Compactness Theorem
    Khinchin's Small Book of Big Impact
    Long Live the Young Theory!
    Eighty Years of Ramsey R(3, k) � and Counting!
    George, Esther, Paul
    Erdos Magic
    An Erdos Gem
    Upper Bounds
    The Lov�sz Local Lemma
    Random Greedy Triangle-Free
    R(3, k) Resolved!
    Random Greedy Triangle-Free Redux
    Ramsey Numbers Involving Cycles
    Scope and Notation
    Two-Color Numbers Involving Cycles
    Cycles Versus Complete Graphs
    Cycles Versus Wheels
    Cycles Versus Books
    Cycles Versus Other Graphs
    Multicolor Numbers for Cycles
    Three Colors
    More Colors
    Cycles Versus Other Graphs
    Hypergraph Numbers for Cycles
    On the Function of Erdos and Rogers
    The Most Restrictive Case
    Proof of f<sub>s,s+1</sub>(n)&#8804;0(n<sup>1-1/0(s<sup>4</sup>log s)</sup>)[1]
    Proof of �(n<sup>�</sup>)&#8804;f<sub>s,s+1</sub>(n) for s&#8805;2[2]
    Proof of f<sub>s,s+1</sub>(n) &#8804;0(n<sup>2/3</sup>) for s&#8805;2 [4]
    General Bounds
    Proof of �(n<sup>a<sub>k</sub>(s)</sup>)&#8804;f<sub>s,s+k</sub>(n) [14, 15]
    Sketch of the Proof of f<sub>s,s+k</sub>(n)&#8804;0(n<sup>((k+1)/(2k+1))+�</sup>) for s&#8805;s<sub>0</sub> = s<sub>0</sub>(�, k) [4]
    Concluding Remarks
    Large Monochromatic Components in Edge Colorings of Graphs: A Survey
    A Remark of Erdos and Rado and Its Extension
    Colorings from Affine Planes
    Extending Colorings by Substitutions
    Type of Spanning Trees, Connectivity, Diameter
    Gallai-Colorings: Substitutions to 2-Colorings
    Multicolorings: Basic Results and Proof Methods
    Complete Bipartite Graphs: Counting Double Stars
    Fractional Transversals: F�redi's Method
    Fine Tuning
    When Both Methods Work: Local Colorings
    Multicolorings: Type of Components
    Components with Large Matching
    Double Stars
    Vertex-Coverings by Components
    Coloring by Group Elements
    Coloring Geometric Graphs
    Coloring Noncomplete Graphs
    Szlam's Lemma: Mutant Offspring of a Euclidean Ramsey Problem from 1973, with Numerous Applications
    1973: A Volcano Erupts
    Some Definitions and More Background
    What Happened to the Rather Red Coloring Problem from 1973?
    Distance Graphs
    Szlam's Lemma, a Connection Between Rather Red Colorings and Chromatic Numbers
    van der Waerden Numbers, Cyclic van der Waerden Numbers, and a Lower Bound on Them Both
    Open Problems in Euclidean Ramsey Theory
    Ramsey Sets
    Unit Distance Graphs
    More General Distance Graphs
    Chromatic Number of the Plane & Its Relatives, History, Problems and Results: An Essay in 11 Parts
    The Problem
    The History
    Polychromatic Number of the Plane & Results Near the Lower Bound
    De Bruijn-Erdos Reduction to Finite Sets and Results Near the Lower Bound
    Polychromatic Number of the Plane & Results Near the Upper Bound
    Continum of 6-Colorings of the Plane
    Chromatic Number of the Plane in Special Circumstances
    Colored Space
    Rational Coloring
    Axioms of Set Theory and the Chromatic Number of Graphs
    Predicting the Future
    Euclidean Distance Graphs on the Rational Points
    The Search for �(R<sup>n</sup>, 1) Leads to the Search for �(Q<sup>n</sup>, 1)
    Distances Other Than 1?
    Open Problems Session
    Problems Submitted
    Problems Submitted
    Problems on Topological Stability of Chromatic Numbers Submitted
    Problem on the Gallai-Ramsey Structure, Submitted
    Problems Involving Triangles, Submitted
    Problems on Chromatic Number of the Plane and Its Relatives, Submitted

    Buy it from $54.74

    Please choose a buying option

    Your Price:
    You save:
    Buy It Now
    what's this?
    Rush Rewards U
    Members Receive:
    You have reached 400 XP and carrot coins. That is the daily max!
    Free shipping on orders over $35*

    *A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

    Learn more about the TextbookRush Marketplace.