OFFSET
1,1
COMMENTS
a(n) <= n^4 + 5 (cf. Alm, 2017).
The subgroup H, along with its n-1 cosets, induces a cyclic coloring on K_q. Labeling the vertices 0 through q-1, color the edge uv by the color corresponding to the coset containing u-v (mod q). Thus if q >= a(n), the coloring induced by H and its cosets must contain a monochromatic triangle. In fact, it contains many monochromatic triangles in each color class.
The data gathered thus far suggest that the bound n^4 + 5 can be replaced by cn^3 for some c > 1, but there is no proof.
LINKS
Jeremy F. Alm, 401 and beyond: improved bounds and algorithms for the Ramsey algebra search, Journal of Integer Sequences, Vol. 20 (2017), Article 17.8.4. (Also here: arXiv:1609.01817 [math.NT], 2016.)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jeremy F. Alm, Nov 06 2017
STATUS
approved