Off-diagonal multicolor ordered Ramsey bounds

Improve the upper and lower bounds on the off-diagonal multicolor ordered Ramsey numbers R_<(K^<_3,…,K^<_3,M^<;q).

Background

The known lower and upper bounds for the multicolor off-diagonal problem are far apart. The problem asks for quantitative improvement on both sides.

References

These bounds are far apart and it is not clear where the truth should lie.

Improve the upper and lower bounds on off-diagonal multicolor ordered Ramsey numbers $R_<(K<_3, \dots, K<_3, M<;q)$.

— A Survey on Ordered Ramsey Numbers  (2502.02155 - Balko, 4 Feb 2025) in Problem following off-diagonal multicolor bounds, Section 2.5

These bounds are far apart and it is not clear where the truth should lie.

— A Survey on Ordered Ramsey Numbers  (2502.02155 - Balko, 4 Feb 2025) in Problem in Subsection “Multicolor Ordered Ramsey Numbers”

Improve the upper and lower bounds on off-diagonal multicolor ordered Ramsey numbers $R_<(K<_3, \dots, K<_3, M<;q)$.

— A Survey on Ordered Ramsey Numbers  (2502.02155 - Balko, 4 Feb 2025) in Problem in subsection “Multicolor Ordered Ramsey Numbers”