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

Graph theory is a fascinating and inviting branch of mathematics. Many problems are easy to state and have natural visual representations, inviting exploration by new students and professional mathematicians. The goal of this textbook is to present the fundamentals of graph theory to a wide range of readers. The book contains many significant recent results in graph theory, presented using up-to-date notation. The author included the shortest, most elegant, most intuitive proofs for modern and classic results while frequently presenting them in new ways. Major topics are introduced with practical applications that motivate their development, and which are illustrated with examples that show how to apply major theorems in practice. This includes the process of finding a brute force solution (case-checking) when an elegant solution is not apparent. With over 1200 exercises, internet resources (e.g., the OEIS for counting problems), helpful appendices, and a detailed guide to different course outlines, this book provides a versatile and convenient tool for the needs of instructors at a large variety of institutions.

Praise for the First Edition "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.

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.

From the reviews: "Béla Bollobás introductory course on graph theory deserves to be considered as a watershed in the development of this theory as a serious academic subject. ... The book has chapters on electrical networks, flows, connectivity and matchings, extremal problems, colouring, Ramsey theory, random graphs, and graphs and groups. Each chapter starts at a measured and gentle pace. Classical results are proved and new insight is provided, with the examples at the end of each chapter fully supplementing the text... Even so this allows an introduction not only to some of the deeper results but, more vitally, provides outlines of, and firm insights into, their proofs. Thus in an elementary text book, we gain an overall understanding of well-known standard results, and yet at the same time constant hints of, and guidelines into, the higher levels of the subject. It is this aspect of the book which should guarantee it a permanent place in the literature." #Bulletin of the London Mathematical Society#1

An in-depth account of graph theory, written for serious students of mathematics and computer science. It reflects the current state of the subject and emphasises connections with other branches of pure mathematics. Recognising that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavour of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory, the book presents a detailed account of newer topics, including Szemerédis Regularity Lemma and its use, Shelahs extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. Moreover, the book contains over 600 well thought-out exercises: although some are straightforward, most are substantial, and some will stretch even the most able reader.