High-girth Ramsey graph conjecture for ordered forests
High-girth Ramsey graph conjecture for ordered forests
Let and be ordered forests, and let be a positive integer. Write for the family of Ramsey graphs of , and let denote the girth of a graph . High-girth Ramsey graph conjecture. There is an such that
This would extend the corresponding high-girth Ramsey-graph property from unordered forests to ordered forests; the paper presents it as an expected fact, and no resolution is given.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.