## Aspects of Combinatorics and Combinatorial Number TheoryAspects of Combinatorics and Combinatorial Number Theory discusses various Ramsey-type theorems in combinatorics and combinatorial number theory. While many of the main results are classic, the book describes recent progress and considers unsolved questions in the field. For classical theorems, whenever possible, the author presents different proofs than those offered in Graham, Rothschild, and Spencer's book. For instance, Johnson's proof has been given for Erdoes-Szekeres Theorem, and in establishing that proof, the author makes reference to the other proofs. The first part of the book is primarily concerned with the history, context, and rudiments of the subject, and it requires only a basic maturity in mathematical thinking. The later parts and the remarks following each section describe many rather recent Ramsey-type results in combinatorics with application of topological ideas. These parts require some training in algebra and topology. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Preface vii | 1 |

van der Waerden revisited | 23 |

Generalizations of Schurs theorem | 37 |

Topological methods | 49 |

Euclidean Ramsey theory | 61 |

Additive number Theory and related questions | 75 |

Partitions of integers | 95 |

Ramseytype results in posets | 117 |

Solutions to selected exercises | 129 |

143 | |

153 | |

### Other editions - View all

Aspects of Combinatorics and Combinatorial Number Theory Sukumar Das Adhikari No preview available - 2002 |

### Common terms and phrases

2-subsets 4.1 of Chapter arithmetic progression assume belong coefficient colouring of Z+ compact semigroup congruent conjecture consider contains an arithmetic corresponding defined denote the number distinct elements equation equivalence relation Erdos Euclidean EXERCISE 2.1 finite colouring finite set fliptop Furstenberg and Katznelson graph G graphical representation Hales-Jewett theorem hence Hindman's theorem idempotent implies induction left ideal Lemma length linear matrix minimal left ideal modulo monochromatic combinatorial line monochromatic set monochromatic solution monochromatic subset natural density non-empty subsets non-zero notation NU(T NU(V number of partitions observe obtained pairwise disjoint partition function pigeonhole principle polynomial posets positive integer prime proof of Theorem prove r-colouring Rado Ramsey theory Ramsey's theorem real numbers REMARK result Rodl satisfying Schur's theorem Section semigroup sequence Shelah Shelah line Sidon set statement Szemeredi Theorem 3.1 theorem Theorem topological triangle vector vertices Waerden's theorem words Z+)d zero