Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ARSCOM

2002

2002

In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partition theorem for them based on repeated applications of van der Waerden's theorem on arithmetic progressions. In this paper, we give the complete proof of Deuber's, however with the more recent parameter set proof of his partition result for (m, p, c)-sets. We then adapt this parameter set proof to show that for any k, m, p, c, every Kk-free graph on the positive integers contains an (m, p, c)-set, each of whose rows are independent sets.

Added |
16 Dec 2010 |

Updated |
16 Dec 2010 |

Type |
Journal |

Year |
2002 |

Where |
ARSCOM |

Authors |
David S. Gunderson |

Comments (0)