Forest Ramsey-graph conjecture for finite ordered forest pairs
Forest Ramsey-graph conjecture for finite ordered forest pairs
From papers
Let and be ordered forests, and let denote the family of Ramsey graphs of . Forest Ramsey-graph conjecture. If is Ramsey finite, then contains a forest. The claim removes a previously used -unavoidability assumption; the source cites supporting evidence, but also states that its reverse is false, and does not resolve this direction.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jonathan Rollin, “Minimal Ordered Ramsey Graphs”, arXiv:1712.09034 (2017).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.