Bowtie-free graphs have a Ramsey lift
From MaRDI portal
Publication:2413002
DOI10.1016/j.aam.2017.12.005zbMath1383.05206arXiv1402.2700OpenAlexW1955183331MaRDI QIDQ2413002
Jaroslav Nešetřil, Jan Hubička
Publication date: 6 April 2018
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.2700
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Categoricity and completeness of theories (03C35)
Related Items
Ramsey classes with forbidden homomorphisms and a closure ⋮ A Ramsey class for Steiner systems ⋮ Universality vs genericity and \(C_4\)-free graphs ⋮ Spectral extremal graphs for the bowtie ⋮ Ramsey theorem for designs ⋮ Bowtie‐free graphs and generic automorphisms ⋮ Ramsey transfer to semi-retractions ⋮ On positive local combinatorial dividing-lines in model theory ⋮ Ramsey properties and extending partial automorphisms forhbox classes of finite structures ⋮ Supersaturation problem for the bowtie ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey classes with forbidden homomorphisms and a closure
- The partite construction and Ramsey set systems
- The Ramsey property for graphs with forbidden complete subgraphs
- Partitions of finite relational and set systems
- Universal graphs with forbidden subgraphs and algebraic closure
- Universal graphs with a forbidden subgraph: block path solidity
- For graphs there are only four types of hereditary Ramsey classes
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Forbidden subgraphs and forbidden substructures
- More on the Kechris–Pestov–Todorcevic correspondence: Precompact expansions
- Survey of results on the maximum genus of a graph
- Homomorphism and embedding universal structures for restricted classes
- Ramsey Classes and Homogeneous Structures
- Complexities of Relational Structures
- Universal graphs with a forbidden near‐path or 2‐bouquet
- INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
- Some remarks on universal graphs
