1 problem

Let $H$ and $H'$ be $\chi$-unavoidable connected ordered graphs, each with at least two edges. Connected ordered-graph finiteness conjecture. The pair $(H,H')$ is Ramsey finite if a…