DOI: 10.3390/sym16121660 ISSN: 2073-8994
A New Proof of Ramsey’s Theorem
Jakub Jan Ludew, Bogdana Oliynyk, Michał Różański, Alicja Samulewicz, Adrian Smuda, Monika Szymura, Roman WitułaRamsey’s theorem states that for any natural numbers n, m there exists a natural number N such that any red–blue coloring of the graph KN contains either a red Kn or blue Km as a subgraph. The smallest such N is called the Ramsey number, denoted as R(n,m). In this paper, we reformulate this theorem and present a proof of Ramsey’s theorem that is novel as far as we are aware.