Elementary Methods of Graph Ramsey Theory

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

This book is intended to provide graduate students and researchers in graph theory with an overview of the elementary methods of graph Ramsey theory. It is especially targeted towards graduate students in extremal graph theory, graph Ramsey theory, and related fields, as the included contents allow the text to be used in seminars.

It is structured in thirteen chapters which are application-focused and largely independent, enabling readers to target specific topics and information to focus their study. The first chapter includes a true beginner’s overview of elementary examples in graph Ramsey theory mainly using combinatorial methods. The following chapters progress through topics including the probabilistic methods, algebraic construction, regularity method, but that’s not all.

Many related interesting topics are also included in this book, such as the disproof for a conjecture of Borsuk on geometry, intersecting hypergraphs, Turan numbers and communication channels, etc.