Forest Ramsey-graph conjecture for finite ordered forest pairs

About 9 years old · traced to

Let HH and H′H' be ordered forests, and let R<(H,H′)R_<(H,H') denote the family of Ramsey graphs of (H,H′)(H,H'). Forest Ramsey-graph conjecture. If (H,H′)(H,H') is Ramsey finite, then R<(H,H′)R_<(H,H') contains a forest. The claim removes a previously used χ\chi-unavoidability assumption; the source cites supporting evidence, but also states that its reverse is false, and does not resolve this direction.

References

Primary source

Jonathan Rollin, “Minimal Ordered Ramsey Graphs”, arXiv:1712.09034 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.