A survey of bounds for classical Ramsey numbers
From MaRDI portal
Publication:4745846
DOI10.1002/jgt.3190070105zbMath0508.05046MaRDI QIDQ4745846
Charles M. Grinstead, Fan R. K. Chung
Publication date: 1983
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190070105
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C55: Generalized Ramsey theory
Related Items
Edge-colored complete graphs with precisely colored subgraphs, Three color Ramsey number of \(K_ 4-e\), Lower bounds for bi-colored quaternary Ramsey numbers, Edge-colorings avoiding rainbow and monochromatic subgraphs, A tutorial on the use of graph coloring for some problems in robotics, Quantitative forms of a theorem of Hilbert, Some new computer generated results in Ramsey graph theory, Quantitative theorems for regular systems of equations, The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős, Some properties of Ramsey numbers, Difference Ramsey numbers and Issai numbers, Lower bounds for small diagonal Ramsey numbers, A note on upper bounds for some Ramsey numbers, Upper and lower Ramsey bounds in bounded arithmetic
Cites Work
- An upper bound on the Ramsey numbers R(3,k)
- On group partitions associated with lower bounds for symmetric Ramsey numbers
- Sum-free sets and Ramsey numbers. II
- Graph Theory and Probability. II
- New lower bounds of some diagonal Ramsey numbers
- Construction of Special Edge-Chromatic Graphs
- Backtrack Programming
- Combinatorial Relations and Chromatic Graphs
