A Short Proof of the Random Ramsey Theorem

نویسندگان

  • Rajko Nenadov
  • Angelika Steger
چکیده

In this paper we give a short proof of the Random Ramsey Theorem of Rödl and Ruciński: for any graph F which contains a cycle and r ≥ 2, there exist constants c, C > 0 such that P[Gn,p → (F )r] = { 1− o(1), p ≥ Cn−1/m2(F ) o(1), p ≤ cn−1/m2(F , where m2(F ) = maxJ⊆F,vJ≥2 eJ−1 vJ−2 . The proof of the 1-statement is based on the recent beautiful hypergraph container theorems by Saxton/Thomason and Balogh/Morris/Samotij. The proof of the 0-statement is elementary.

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

ثبت نام

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

منابع مشابه

A SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS

In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.

متن کامل

Groups with one conjugacy class of non-normal subgroups‎ - ‎a short proof

For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.

متن کامل

The strength of the rainbow Ramsey Theorem

The Rainbow Ramsey Theorem is essentially an “anti-Ramsey” theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey’s Theorem, even in the weak system RCA0 of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ra...

متن کامل

Ramsey numbers of sparse hypergraphs

We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree has Ramsey number at most c( , k)n, for an appropriate constant c( , k). This result was recently proved by several authors, but those proofs are all based on applications of the hypergraph regularity method. Here we give a much simpler, self-contained proof which uses new techniques developed recently by th...

متن کامل

A new proof for the Banach-Zarecki theorem: A light on integrability and continuity

To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2016