A Sharp Ramsey Theorem for Admissible Colorings of Ordered Cliques

Yanan Hu, Zhenhua Lyu, Chenxi Yang

Let \(f(k)\) be the minimum integer \(N\) such that any red--blue edge-coloring of the ordered complete graph on \(N\) vertices contains a set of \(k\) vertices whose induced color…