Ramsey numbers for complete graphs versus generalized fans
From MaRDI portal
Publication:2102757
DOI10.1007/S00373-022-02590-ZzbMath1502.05160arXiv2111.06107OpenAlexW4308792757MaRDI QIDQ2102757
Publication date: 29 November 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.06107
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some star-critical Ramsey numbers
- Star-critical Ramsey number of \(F_n\) versus \(K_4\)
- Star-critical Ramsey numbers
- Ramsey goodness and generalized stars
- On Ramsey numbers of fans
- Ramsey numbers for quadrangles and triangles
- Small Ramsey numbers
- Ramsey number of \(K_3\) versus \(F_{3, n}\)
- The graph Ramsey number \(R(F_\ell, K_6)\)
- Star-critical Ramsey numbers for large generalized fans and books
- Improved bounds on the Ramsey number of fans
- Star-critical Ramsey numbers of generalized fans
- On Ramsey and star-critical Ramsey numbers for generalized fans versus \(n K_m\)
- A new upper bound for the Ramsey number of fans
- Ramsey Numbers Involving Graphs with Long Suspended Paths
- The Ramsey numbers of fans versus a complete graph of order five
- Ramsey Theorems for Multiple Copies of Graphs
- A NOTE ON RAMSEY NUMBERS FOR FANS
This page was built for publication: Ramsey numbers for complete graphs versus generalized fans