A survey of bounds for classical Ramsey numbers
From MaRDI portal
Publication:4745846
Cites work
- An upper bound on the Ramsey numbers R(3,k)
- Backtrack Programming
- Combinatorial Relations and Chromatic Graphs
- Construction of Special Edge-Chromatic Graphs
- Graph Theory and Probability. II
- New lower bounds of some diagonal Ramsey numbers
- On group partitions associated with lower bounds for symmetric Ramsey numbers
- Sum-free sets and Ramsey numbers. II
Cited in
(22)- On multicolor Ramsey numbers and subset coloring of hypergraphs
- Some new computer generated results in Ramsey graph theory
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- Edge-colored complete graphs with precisely colored subgraphs
- Lower bounds for small diagonal Ramsey numbers
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
- Some properties of Ramsey numbers
- On some open questions for Ramsey and Folkman numbers
- Upper and lower Ramsey bounds in bounded arithmetic
- On a diagonal conjecture for classical Ramsey numbers
- A tutorial on the use of graph coloring for some problems in robotics
- Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Lower bounds for bi-colored quaternary Ramsey numbers
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- An adaptive upper bound on the Ramsey numbers \(R(3,\dots,3)\)
- Quantitative forms of a theorem of Hilbert
- Quantitative theorems for regular systems of equations
- Three color Ramsey number of \(K_ 4-e\)
- Regular languages viewed from a graph-theoretic perspective
- A note on upper bounds for some Ramsey numbers
- Difference Ramsey numbers and Issai numbers
This page was built for publication: A survey of bounds for classical Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745846)
