For cycles and balanced complete multipartite graphs, every forest of copies of F is forced in large Ramsey graphs, but infinitely many graphs F admit Ramsey graphs that avoid all non-trivial such forests.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unavoidable subgraphs in Ramsey graphs
For cycles and balanced complete multipartite graphs, every forest of copies of F is forced in large Ramsey graphs, but infinitely many graphs F admit Ramsey graphs that avoid all non-trivial such forests.