Revision #645 → #1522 · back to history
addedRamsey's theorem (graph form)9c00c7eb24cb
addedExistence of R(r,s) (two colours)2a2a0cfbf1d9
addedRamsey's theorem (c colours)d7857184ba75
addedR(3,3) ≤ 63f978bfe89e3
addedR(3,3) ≤ 6 via double counting59aded46bbf2
addedR(3,3) = 68d235cd6cc76
addedMulticolour Ramsey number317490672372
addedKnown multicolour Ramsey numbers16e6e8a6c515
addedR(3,3,3) ≤ 172b0493cbc7fe
addedR(3,3,3) = 17a3cc22d10e25
addedClebsch graph from colour class514dd2958b0d
addedTwo colourings on K153a518a279fe0
added115 colourings on K14827271eb27e0
addedBounds on a(4)581384920039
addedR(n,2) = R(2,n) = n0b1a1448f181
addedLemma 1 (induction inequality)b1d237332d38
addedStrengthened inequality (even case)c63c0b6e9c33
addedLemma 2 (more colours)45b0f971ac55
addedFiniteness of Ramsey numbers7011dcea4d31
addedRamsey numbersdfd783bbbe75
addedSymmetry R(m,n) = R(n,m)a22d7ce63e60
addedRamsey graph38c5da45e8a6
addedBrute-force complexity469ed6c29fab
addedQuantum still exponentialec85652af6af
addedR(s,2) = s1d54c4c4ce2f
addedR(4,3) ≤ 9 and R(4,4) ≤ 182be4e9bd6c25
addedR(4,4) = 1895b5c617a292
addedR(4,5) = 25de42886cf7d3
addedBounds on R(5,5)3778a0ad8a2a
addedConjecture R(5,5) = 43b80e95892092
addedR(P_n, K_m) formula (Erdős)c42b17e6d576
addedR(T_n, K_m) formula (Chvátal)eb32c136be9a
addedErdős–Szekeres upper boundaf6fb9318fc1
addedDiagonal upper bound (r = s)22faad7fb9f9
addedExponential lower bound (Erdős)5b91d89e22c6
addedBest known diagonal bounds55976bd5e7a2
addedCampos et al. improved upper boundcd2a33678e9d
addedBalister et al. multicolour boundf4d40a18b761
addedGupta et al. improvement145624d4294b
addedOrder of R(3,t)e1d9442d358b
addedOff-diagonal lower bound (H-free process)54160cd1368f
addedMattheus–Verstraete lower bound61c3ab30d2ca
addedR(3,8) and R(3,9) verifiedf37ac20ce709
addedR(4,5) verified = 25eda83f7af026
addedInduced Ramsey theorem0864a21349e0
addedInduced Ramsey number32622afbdec2
addedAsymmetric induced Ramsey number50e14540246d
addedErdős conjecture on r_ind(H)ec44b5b4a4b6
addedErdős–Hajnal 1984 bound2a45307bc613
addedKohayakawa–Prömel–Rödl bound775e44043480
addedFox–Sudakov construction674a897cde00
addedConlon–Fox–Sudakov bounde44c89ef39ef
addedErdős 1947 inequalities66e9ed6fe6a3
addedLinear r_ind for cycle/path/star054c44a1d52f
addedr_ind for treese2297bcab6e8
addedBounded-degree conjecturef6ab9e6b984d
addedConlon–Fox–Zhao bounda9d65231d9c0
addedMulticolour induced Ramsey numberbbe98ca6d3de
addedFox–Sudakov multicolour boundd85fe036d6f5
addedTower function2d0915f65d0c
addedHypergraph induced Ramsey bound11cec08c935b
addedInfinite Ramsey theorem113a4c7e232d
addedErdős–Dushnik–Miller theorem1cb759173f00
addedInfinite implies finite Ramsey5bd881ab31ed
addedm-hypergrapha82cbf09c8cc
addedRamsey's theorem for hypergraphs389908ba5bc0
addedR(4,4;3) = 13feb92ddf2762
addedHypergraph lower bounds4c63f0242979
addedDirected Ramsey number R(n)c844600278c1
addedValues of directed R(n)a8ce3743aa75
addedPartition-calculus form5ab56e1cd825
addedSierpiński's negative result15a823488236
addedTodorčević's ZFC result6ba85225c664
addedRamsey cardinal5b7784d1783c
addedRamsey cardinals unprovable in ZFCa2430dfdf88a
addedSeetapun's theorem693953fc519d
addedRamsey's theorem RT^n_k38362a84c53b
addedRamsey's theorem RT^nae82b21975b4
addedStable coloringdb3ec47cc87f
addedStable Ramsey's theorem for pairsdcc5d03d4b0d
addedRT^1 is infinite pigeonhole63bb4b96f530
addedRT^2_k strengthc5ba0229a6f8
addedΣ-induction schema49238850936e
addedΣ-bounding schemae6b6d276857d
addedMutually incomparable over RCA01b871a8696ef
addedCombined system too weak73ea756c75d4
addedEquivalent strength RT^n_kc06f8efae2f3
addedRT^n stronger than ACA0b2047122cded
addedRecursion-theoretic strength9af270f69341
addedImplies Kőnig's lemma413f930675e7