Ramsey number R(6,8)R(6,8)

The smallest number nn such that any two-coloring of the edges of the complete graph KnK_n must contain either a monochromatic K6K_{6} in the first color or a monochromatic K8K_{8} in the second color.

Lower bound: 134134
Upper bound: 423423

Updates