Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
From MaRDI portal
Publication:2701404
DOI10.1007/s00373-023-02640-0OpenAlexW4362663712MaRDI QIDQ2701404
Publication date: 28 April 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00675
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some Ramsey-Turán type problems and related questions
- On multicolor Ramsey number of paths versus cycles
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On the multi-colored Ramsey numbers of paths and even cycles
- Arithmetic progressions, different regularity lemmas and removal lemmas
- The Ramsey number for a triple of long even cycles
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- Ramsey goodness and beyond
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\)
- The 3-colored Ramsey number of even cycles
- On some three color Ramsey numbers for paths and cycles
- Path-cycle Ramsey numbers
- All Ramsey numbers for cycles in graphs
- Generalized Ramsey theory for multiple colors
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- The Ramsey numbers for a triple of long cycles
- Path Ramsey numbers in multicolorings
- Bounds for graph regularity and removal lemmas
- Ramsey numbers of books and quasirandomness
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Ramsey-goodness -- and otherwise
- Ramsey numbers for bipartite graphs with small bandwidth
- Three-color Ramsey numbers for paths
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Monochromatic Cycles in 2-Coloured Graphs
- Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
- Embedding into Bipartite Graphs
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey
- On the multi-colored Ramsey numbers of cycles
- On maximal paths and circuits of graphs
- Multicolor Ramsey numbers for some paths and cycles
- The Ramsey number of books
- Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
- On Regularity Lemmas and their Algorithmic Applications
- Large Book-Cycle Ramsey Numbers
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- Ramsey numbers of large books
This page was built for publication: Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
