A survey of bounds for classical Ramsey numbers
From MaRDI portal
Publication:4745846
DOI10.1002/JGT.3190070105zbMATH Open0508.05046OpenAlexW2011896212MaRDI QIDQ4745846FDOQ4745846
Authors: Charles M. Grinstead, Fan 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
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Generalized Ramsey theory (05C55)
Cites Work
- Combinatorial Relations and Chromatic Graphs
- Backtrack Programming
- Graph Theory and Probability. II
- New lower bounds of some diagonal Ramsey numbers
- Construction of Special Edge-Chromatic Graphs
- 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
Cited In (22)
- 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
- On some open questions for Ramsey and Folkman numbers
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
- Some properties of Ramsey 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
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- Lower bounds for bi-colored quaternary Ramsey numbers
- 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\)
- A note on upper bounds for some Ramsey numbers
- Regular languages viewed from a graph-theoretic perspective
- Difference Ramsey numbers and Issai numbers
- On multicolor Ramsey numbers and subset coloring of hypergraphs
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)
