Abstract
We estimate the minimum possible Ramsey numbers for graphs of given order.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 193-199 |
| Number of pages | 7 |
| Journal | Discrete Mathematics |
| Volume | 199 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Mar 28 1999 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Cite this
}
The smallest ramsey numbers. / Csákány, Rita; Komlos, Janos.
In: Discrete Mathematics, Vol. 199, No. 1-3, 28.03.1999, p. 193-199.Research output: Contribution to journal › Article
TY - JOUR
T1 - The smallest ramsey numbers
AU - Csákány, Rita
AU - Komlos, Janos
PY - 1999/3/28
Y1 - 1999/3/28
N2 - We estimate the minimum possible Ramsey numbers for graphs of given order.
AB - We estimate the minimum possible Ramsey numbers for graphs of given order.
UR - http://www.scopus.com/inward/record.url?scp=0042207113&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0042207113&partnerID=8YFLogxK
U2 - https://doi.org/10.1016/S0012-365X(98)00300-8
DO - https://doi.org/10.1016/S0012-365X(98)00300-8
M3 - Article
VL - 199
SP - 193
EP - 199
JO - Discrete Mathematics
JF - Discrete Mathematics
SN - 0012-365X
IS - 1-3
ER -