1 problem
- 0 votes0 replies0 views
Characterization of finite pairs of chi-unavoidable connected ordered graphs
Let and be -unavoidable connected ordered graphs, each with at least two edges. Connected ordered-graph finiteness conjecture. The pair is Ramsey finite if a…