A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\)
From MaRDI portal
Publication:317436
DOI10.1016/j.dam.2016.06.003zbMath1346.05185arXiv1507.01133OpenAlexW2471254007MaRDI QIDQ317436
Rujie Zhu, Xiaodong Xu, Stanislaw P. Radziszowski
Publication date: 30 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.01133
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- The chromatic gap and its extremes
- Some constructive bounds on Ramsey numbers
- A note on the independence number of triangle-free graphs
- A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)
- New computational upper bounds for Ramsey numbers \(R(3,k)\)
- Some structural properties of low-rank matrices related to computational complexity
- More Constructive Lower Bounds on Classical Ramsey Numbers
- A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs
- Dynamic concentration of the triangle-free process