The Triangle Free Process And The Ramsey Number R 3 K
Download The Triangle Free Process And The Ramsey Number R 3 K PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get The Triangle Free Process And The Ramsey Number R 3 K book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
The Triangle-Free Process and the Ramsey Number R(3,k)
Author: Gonzalo Fiz Pontiveros
language: en
Publisher: American Mathematical Soc.
Release Date: 2020-04-03
The areas of Ramsey theory and random graphs have been closely linked ever since Erdős's famous proof in 1947 that the “diagonal” Ramsey numbers R(k) grow exponentially in k. In the early 1990s, the triangle-free process was introduced as a model which might potentially provide good lower bounds for the “off-diagonal” Ramsey numbers R(3,k). In this model, edges of Kn are introduced one-by-one at random and added to the graph if they do not create a triangle; the resulting final (random) graph is denoted Gn,△. In 2009, Bohman succeeded in following this process for a positive fraction of its duration, and thus obtained a second proof of Kim's celebrated result that R(3,k)=Θ(k2/logk). In this paper the authors improve the results of both Bohman and Kim and follow the triangle-free process all the way to its asymptotic end.
Ramsey Theory
Author: Xiaodong Xu
language: en
Publisher: Walter de Gruyter GmbH & Co KG
Release Date: 2018-08-06
Key problems and conjectures have played an important role in promoting the development of Ramsey theory, a field where great progress has been made during the past two decades, with some old problems solved and many new problems proposed. The present book will be helpful to readers who wish to learn about interesting problems in Ramsey theory, to see how they are interconnected, and then to study them in depth. This book is the first problem book of such scope in Ramsey theory. Many unsolved problems, conjectures and related partial results in Ramsey theory are presented, in areas such as extremal graph theory, additive number theory, discrete geometry, functional analysis, algorithm design, and in other areas. Most presented problems are easy to understand, but they may be difficult to solve. They can be appreciated on many levels and by a wide readership, ranging from undergraduate students majoring in mathematics to research mathematicians. This collection is an essential reference for mathematicians working in combinatorics and number theory, as well as for computer scientists studying algorithms. Contents Some definitions and notations Ramsey theory Bi-color diagonal classical Ramsey numbers Paley graphs and lower bounds for R(k, k) Bi-color off-diagonal classical Ramsey numbers Multicolor classical Ramsey numbers Generalized Ramsey numbers Folkman numbers The Erdős–Hajnal conjecture Other Ramsey-type problems in graph theory On van der Waerden numbers and Szemeredi’s theorem More problems of Ramsey type in additive number theory Sidon–Ramsey numbers Games in Ramsey theory Local Ramsey theory Set-coloring Ramsey theory Other problems and conjectures
Elementary Methods of Graph Ramsey Theory
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, Turán numbers and communication channels, etc.