Some constructive bounds on Ramsey numbers
From MaRDI portal
Publication:974470
DOI10.1016/J.JCTB.2010.01.003zbMATH Open1200.05137OpenAlexW2149727310MaRDI QIDQ974470FDOQ974470
Authors: Vojtěch Rödl, Alexandr Kostochka, Pavel Pudlák 
Publication date: 3 June 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2010.01.003
Recommendations
- Constructive bounds for a Ramsey-type problem
- Bounding some Ramsey functions
- New bounds on some Ramsey numbers
- An upper bound for some ramsey numbers
- More constructive lower bounds on classical Ramsey numbers
- scientific article; zbMATH DE number 2237376
- Lower bounds for some Ramsey numbers
- An Upper Bound for Constrained Ramsey Numbers
- A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
- scientific article; zbMATH DE number 4106899
Cites Work
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On Graphs that do not Contain a Thomsen Graph
- Explicit Concentrators from Generalized N-Gons
- Asymptotic lower bounds for Ramsey functions
- Norm-graphs: Variations and applications
- Polarities and \(2k\)-cycle-free graphs
- Some structural properties of low-rank matrices related to computational complexity
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Explicit Ramsey graphs and orthonormal labelings
- Constructive lower bounds for off-diagonal Ramsey numbers
Cited In (17)
- On Some Open Questions for Ramsey and Folkman Numbers
- Constructive lower bounds for off-diagonal Ramsey numbers
- A construction for Ramsey numbers for \(K_{m,n}\)
- Two-colored Ramsey-Turán densities involving triangles
- Ramsey classes: examples and constructions
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph
- Title not available (Why is that?)
- Hasse diagrams with large chromatic number
- Some Aspects of the Ramsey Theory of Real Numbers
- The automorphism group of projective norm graphs
- Independent sets in polarity graphs
- A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\)
- Title not available (Why is that?)
- More constructive lower bounds on classical Ramsey numbers
- Title not available (Why is that?)
- A note on pseudorandom Ramsey graphs
- Some recent results on Ramsey-type numbers
This page was built for publication: Some constructive bounds on Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974470)
