• pete_the_cat@lemmy.world
    link
    fedilink
    English
    arrow-up
    5
    arrow-down
    1
    ·
    1 year ago

    TL;GU (too long, gave up) 😂

    But yeah, the first two or three paragraphs are the important parts.

    • nodimetotie@lemmy.worldOP
      link
      fedilink
      English
      arrow-up
      4
      ·
      1 year ago

      Probably these two paragraphs sum up the background for the problem nicely

      A common analogy for Ramsey theory requires us to consider how many people to invite to a party so that at least three people will either already be acquainted with each other or at least three people will be total strangers to each other.

      Here, the Ramsey number, r, is the minimum number of people needed at the party so that either s people know each other or t people don’t know each other. This can be written as r(s,t), and we know the answer to r(3,3) = 6.

      I was more interested in finding out about Ramsey theorem, though, rather than this new result.