Ramsey theory is a fascinating topic. The author shares his view of the topic in this contemporary overview of Ramsey theory. He presents from several points of view, adding intuition and detailed proofs, in an accessible manner unique among most books on the topic. This book covers all of the main results in Ramsey theory along with results that have not appeared in a book before. The presentation is comprehensive and reader friendly. The book covers integer, graph, and Euclidean Ramsey theory with many proofs being combinatorial in nature. The author motivates topics and discussion, rather than just a list of theorems and proofs. In order to engage the reader, each chapter has a section of exercises. This up-to-date book introduces the field of Ramsey theory from several different viewpoints so that the reader can decide which flavor of Ramsey theory best suits them. Additionally, the book offers: A chapter providing different approaches to Ramsey theory, e.g., using topological dynamics, ergodic systems, and algebra in the Stone-Čech compactification of the integers. A chapter on the probabilistic method since it is quite central to Ramsey-type numbers. A unique chapter presenting some applications of Ramsey theory. Exercises in every chapter The intended audience consists of students and mathematicians desiring to learn about Ramsey theory. An undergraduate degree in mathematics (or its equivalent for advanced undergraduates) and a combinatorics course is assumed. TABLE OF CONENTS Preface List of Figures List of Tables Symbols 1. Introduction 2. Integer Ramsey Theory 3. Graph Ramsey Theory 4. Euclidean Ramsey Theory 5. Other Approaches to Ramsey Theory 6. The Probabilistic Method 7. Applications Bibliography Index Biography Aaron Robertson received his Ph.D. in mathematics from Temple University under the guidance of his advisor Doron Zeilberger. Upon finishing his Ph.D. he started at Colgate University in upstate New York where he is currently Professor of Mathematics. He also serves as Associate Managing editor of the journal Integers. After a brief detour into the world of permutation patterns, he has focused most of his research on Ramsey theory.

Basics of Ramsey Theory serves as a gentle introduction to Ramsey theory for students interested in becoming familiar with a dynamic segment of contemporary mathematics that combines ideas from number theory and combinatorics. The core of the of the book consists of discussions and proofs of the results now universally known as Ramsey’s theorem, van der Waerden’s theorem, Schur’s theorem, Rado’s theorem, the Hales–Jewett theorem, and the Happy End Problem of Erdős and Szekeres. The aim is to present these in a manner that will be challenging but enjoyable, and broadly accessible to anyone with a genuine interest in mathematics. Features Suitable for any undergraduate student who has successfully completed the standard calculus sequence of courses and a standard first (or second) year linear algebra course Filled with visual proofs of fundamental theorems Contains numerous exercises (with their solutions) accessible to undergraduate students Serves as both a textbook or as a supplementary text in an elective course in combinatorics and aimed at a diverse group of students interested in mathematics

In 2003, Kechris, Pestov and Todorcevic showed that the structure of certain separable metric spaces--called ultrahomogeneous--is closely related to the combinatorial behavior of the class of their finite metric spaces. The purpose of the present paper is to explore different aspects of this connection.

Monthly magazine devoted to topics of general scientific interest.

This book constitutes the refereed proceedings of the 5th Biannual German Conference on Knowledge-Based Systems, XPS-99, held in Würzburg, Germany in March 1999. The book presents four invited surveys by leading scientists together with 14 revised full papers selected from more than 50 papers presented at the meeting. The papers address research issues in knowledge engineering, knowledge-based diagnosis, knowledge-based configuration, and case-based reasoning as well as advanced applications of knowledge-based systems in various fields.