"Anyone interested in getting an introduction to Ramsey theorywill find this illuminating..." --MAA Reviews
Covering all the major concepts, proofs, and theorems, theSecond Edition of Ramsey Theory is the ultimate guideto understanding every aspect of Shelah's proof, as well asthe original proof of van der Waerden. The book offers a historicalperspective of Ramsey's fundamental paper from 1930 andErdos' and Szekeres' article from 1935, while placingthe various theorems in the context of T. S. Motzkin'sthought on the subject of "Complete Disorder isImpossible."
Ramsey Theory, Second Edition includes new and excitingcoverage of Graph Ramsey Theory and Euclidean Ramsey Theory andalso relates Ramsey Theory to other areas in discrete mathematics.In addition, the book features the unprovability results of Parisand Harrington and the methods from topological dynamics pioneeredby Furstenburg.
Featuring worked proofs and outside applications, RamseyTheory, Second Edition addresses: * Ramsey and density theorems on both broad and meticulousscales * Extentions and implications of van der Waerden's Theorem,the Hales-Jewett Theorem, Roth's Theorem, Rado'sTheorem, Szemeredi's Theorem, and the Shelah Proof * Regular homogeneous and nonhomogeneous systems andequations * Special cases and broader interdisciplinary applications ofRamsey Theory principles
An invaluable reference for professional mathematicians workingin discrete mathematics, combinatorics, and algorithms, RamseyTheory, Second Edition is the definitive work on thesubject.
About the Author
About the authors RONALD L. GRAHAM is Adjunct Director for Researchat AT&T Bell Laboratories, and University Professor of theMathematical Sciences at Rutgers University. He is coauthor ofConcrete Mathematics and of Old and New Problems in CombinatorialNumber Theory, and serves on the editorial boards of more than 25technical journals. He received his PhD in mathematics from theUniversity of California, Berkeley. BRUCE L. ROTHSCHILD isProfessor of Mathematics at the University of California, LosAngeles. He is Managing Editor of the Journal of CombinatorialTheory. He received his PhD in mathematics from Yale University.JOEL H. SPENCER is a professor of mathematics and computer scienceat the Courant Institute. He is the author of Ten Lectures on theProbabilistic Method and the editor of Random Structures andAlgorithms. He received his PhD in mathematics from HarvardUniversity.
