On two problems in graph Ramsey theory

نویسندگان

  • David Conlon
  • Jacob Fox
  • Benny Sudakov
چکیده

We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every twocoloring of the edges of the complete graph KN contains a monochromatic copy of H. A famous result of Chvátal, Rödl, Szemerédi and Trotter states that there exists a constant c(∆) such that r(H) ≤ c(∆)n for every graph H with n vertices and maximum degree ∆. The important open question is to determine the constant c(∆). The best results, both due to Graham, Rödl and Ruciński, state that there are constants c and c′ such that 2 ′∆ ≤ c(∆) ≤ 2 log . We improve this upper bound, showing that there is a constant c for which c(∆) ≤ 2 log . The induced Ramsey number rind(H) of a graph H is the least positive integer N for which there exists a graph G on N vertices such that every two-coloring of the edges of G contains an induced monochromatic copy of H. Erdős conjectured the existence of a constant c such that, for any graph H on n vertices, rind(H) ≤ 2. We move a step closer to proving this conjecture, showing that rind(H) ≤ 2 log . This improves upon an earlier result of Kohayakawa, Prömel and Rödl by a factor of log n in the exponent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Size-Ramsey Number of Hypergraphs

The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we cons...

متن کامل

All Ramsey (2K2,C4)−Minimal Graphs

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

متن کامل

Conditions on Ramsey Nonequivalence

Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramsey equivalent if they have the same set of Ramsey graphs. Fox et al. [J. Combin. Theory Ser. B 109 (2014), 120–133] asked whether there are two nonisomorphic connected graphs that are Ramsey equivalent. They proved tha...

متن کامل

Some Coloring Problems in Ramsey Theory

In this thesis, we present new results which are concerned with the following four coloring problems in Ramsey Theory. i. The finite form of Brown’s Lemma. ii. Some 2-color Rado numbers. iii. Ramsey results involving Fibonacci sequences. iv. Coloring the odd-distance plane graph. A few of the results in this thesis are cited from earlier works of other authors. Several results are cited from pa...

متن کامل

Obtaining Bounds for Ramsey Numbers

There are two equivalent problem statements for the Ramsey number n = R(k; l). n is the minimum number of vertices in the graph such that it contains a complete graph of k vertices, or an independent set of l vertices. n is the minimum number of vertices such that if all the edges of the complete graph on n vertices, denoted by K n is colored with two colors, fRed, Blueg, then there exists a Re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorica

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2012