2025/02/14 by Christian Reiher, Reiher, Christian, Vojtěch Rödl +3
Computer Science · Mathematics · #05C55 #05D10 #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2502.09830
openalex publication_date 2025/02/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 are `forests of copies of F' amalgamated on vertices and edges. We derive a few further consequences from this structural result and investigate to which extent such forests of copies must be present in Ramsey graphs.