The Four-Color Theorem 1852–1976

(ams.org)

40 points | by bikenaga 1 day ago

1 comments

  • cs702 2 hours ago
    Fantastic read. The OP does a great job of describing how gradual progress occurs in mathematics. Thank you for sharing this on HN.

    Deep down, I'm still hoping someone or something will find a beautiful proof that is more elegant than brute-force counting and verifying that four colors suffice for all unavoidable configurations that reduce to all other possible configurations. According to the article, there are 633 of those configurations. No idea if a more elegant proof is possible, but I hope it is.

    • efavdb 42 minutes ago
      Agree 100% -- wonderful history here. And with such a simple statement, hard to believe / accept the "reason" is that it works for 633 limiting cases.