A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
From MaRDI portal
Publication:3159381
DOI10.1002/JGT.20038zbMATH Open1062.05101OpenAlexW4242364721MaRDI QIDQ3159381FDOQ3159381
Authors: Xu Xiaodong, Xie Zheng, Stanisław P. Radziszowski
Publication date: 16 February 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20038
Recommendations
Cites Work
Cited In (14)
- Lower bounds of Ramsey numbers \(R(k,l)\)
- Title not available (Why is that?)
- A construction for Ramsey numbers for \(K_{m,n}\)
- On some open questions for Ramsey and Folkman numbers
- Large chromatic number and Ramsey graphs
- On Ramsey numbers \(R(K_4-e, K_t)\)
- The chromatic gap and its extremes
- On a diagonal conjecture for classical Ramsey numbers
- Some constructive bounds on Ramsey numbers
- Random cyclic triangle-free graphs of prime order
- A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)
- A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159381)