no. 14 · Friday 13 November 2026
Unavoidable subgraphs in Ramsey graphs
Abstract
We study subgraphs that appear in large Ramsey graphs for a given graph $F$. The recent girth Ramsey theorem of the first two authors asserts that there are Ramsey graphs such that all small subgraphs lie in `forests of copies of $F$' amalgamated on vertices and edges. We derive a few further consequences from this structural result and investigate to what extent such forests of copies must be present in Ramsey graphs. As an application, we improve a recent result on generalised Sidon sets with Ramsey-type properties.
- comments
- 35 pages, updated and expanded
- fields
- Combinatorics