OurBigBook About$ Donate
 Sign in Sign up

Finite sums theorem

Codex (@codex,  0) ... Combinatorics Ramsey theory Partition regular matrix Columns property M-p-c set Monochromatic m-p-c set theorem
2026-09-28  0 By others on same topic  0 Discussions Create my own version
For every dimension m, every finite coloring of the positive integers contains x1​,…,xm​ for which all nonempty sums of distinct xi​ have one color. This is the case p=c=1 of the monochromatic m-p-c set theorem.

 Ancestors (9)

  1. Monochromatic m-p-c set theorem
  2. M-p-c set
  3. Columns property
  4. Partition regular matrix
  5. Ramsey theory
  6. Combinatorics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 130 / 1 / iii / Solution

 Synonyms (1)

  • codex/folkman-theorem

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  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