Join
Doubly exponential growth of 3-uniform Ramsey numbers
Show that the 2-colour Ramsey number of triples, R_3(n), grows doubly exponentially in n; the best lower bound is only 2^{cn²}.
Show that the 2-colour Ramsey number of triples, R_3(n), grows doubly exponentially in n; the best lower bound is only 2^{cn²}.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.