Induced Ramsey-type theorems

Details Induced Ramsey-type theorems Induced Ramsey-type theorems

2007-06-27

arxiv.org/abs/0706.4112v3

Mathematics

Combinatorics

30 pages

Scientific paper

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and Luczak-Rodl. The proofs are based on a simple lemma (generalizing one by Graham, Rodl, and Rucinski) that can be used as a replacement for Szemeredi's regularity lemma, thereby giving much better bounds. The same approach can be also used to show that pseudo-random graphs have strong induced Ramsey properties. This leads to explicit constructions for upper bounds on various induced Ramsey numbers.

Affiliated with

Also associated with

No associations

Rating

Induced Ramsey-type theorems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Induced Ramsey-type theorems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Induced Ramsey-type theorems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455923