Bowtie-free graphs have a Ramsey lift
arXiv:1402.2700 · doi:10.1016/j.aam.2017.12.005
Abstract
A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph has a Ramsey lift (expansion). This solves one of the old problems in the area and it is the first non-trivial Ramsey class with a non-trivial algebraic closure.
32 pages, 5 figures. Minor corrections; reformatted to elsarticle; accepted to Advances in Applied Mathematics
References in corpus (1)
Cited by in corpus (10)
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- Spectral extremal graphs for the bowtie
- Ramsey transfer to semi-retractions
- Ramsey properties and extending partial automorphisms for classes of finite structures
- Automorphism groups and Ramsey properties of sparse graphs
- A Ramsey Class for Steiner Systems
- Spectral supersaturation: Triangles and bowties
- Ramsey theorem for designs
- Supersaturation Problem for the Bowtie
- Twenty years of Nešetřil's classification programme of Ramsey classes