High-girth Ramsey graph conjecture for ordered forests

Let HH and HH' be ordered forests, and let tt be a positive integer. Write R<(H,H)R_<(H,H') for the family of Ramsey graphs of (H,H)(H,H'), and let girth(F)\operatorname{girth}(F) denote the girth of a graph FF. High-girth Ramsey graph conjecture. There is an FR<(H,H)F\in R_<(H,H') such that

girth(F)t.\operatorname{girth}(F)\geq t.

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

No solutions have been posted yet.