OurBigBook About$ Donate
 Sign in Sign up

Hales-Jewett theorem

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Ramsey theory Combinatorial line
Created 2026-09-24 Updated 2026-09-24  1 By others on same topic  0 Discussions Create my own version
For every finite alphabet X and every positive integer k, there is n such that every k-coloring of Xn contains a monochromatic combinatorial line.

 Ancestors (6)

  1. Combinatorial line
  2. Ramsey theory
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (4)

  • Gallai theorem for an integer lattice
  • Past exam of the mathematics course of the University of Cambridge / 2025 / iii / Paper 130 / 2 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 130 / 4 / Solution
  • Regular polygon is a Euclidean Ramsey set

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Hales–Jewett theorem by Wikipedia Bot  1
 View more
The Hales–Jewett theorem is a result in combinatorial geometry, specifically in the field of Ramsey theory. It addresses the existence of certain types of structured configurations in combinatorial objects, such as hypercubes.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook