✦ LIBER ✦

A version of van der Waerden's theorem and a proof of Mishchenko's conjecture on homomorphisms of locally compact groups

✍ Scribed by Shtern, A I

Book ID: 115512066
Publisher: Turpion Limited
Year: 2008
Tongue: English
Weight: 470 KB
Volume: 72
Category: Article
ISSN: 1064-5632
DOI: 10.1070/im2008v072n01abeh002397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Generalization of Baudet's Conjecture

A Generalization of Baudet's Conjecture (Van Der Waerden's Theorem)

✍ Peter G. Anderson 📂 Article 📅 1976 🏛 Mathematical Association of America 🌐 English ⚖ 367 KB

A constructive topological proof of van

A constructive topological proof of van der Waerden's theorem

✍ Thierry Coquand 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 670 KB

A canonical restricted version of van de

A canonical restricted version of van der waerden’s theorem

✍ H. -J. Prömel; B. L. Rothschild 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

A quintessential proof of van der Waerde

A quintessential proof of van der Waerden's theorem on arithmetic progressions

✍ George Mills 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A particularly well suited induction hypothesis is employed to give a short and relatively direct formulation of van der Waerden's argument which establishes that for any partition of the natural numbers into two classes, one of the classes contains arbitrarily long arithmetic progressions.

A short proof of van der Waerden’

A short proof of van der Waerden’s theorem on arithmetic progressions

✍ Graham, R. L.; Rothschild, B. L. 📂 Article 📅 1974 🏛 American Mathematical Society 🌐 English ⚖ 157 KB

Proof of a Conjecture of Bollobás and Ko

Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem

✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .