Indexed by：
Abstract：
For graphs F and G, let F -＞ (G, G) signify that any red/blue edge coloring of F contains a monochromatic G. Define Folkman number f(G; p) to be the smallest order of a graph F such that F -＞ (G, G) and omega(F) ＜= p. It is shown that f(G; p) ＜= cn for graphs G of order n with Delta(G) ＜= Delta, where Delta ＞= 3, c = c(Delta), and p = p(Delta) are positive constants.
Keyword：
Reprint 's Address：
Version：
Source ：
SIAM JOURNAL ON DISCRETE MATHEMATICS
ISSN： 0895-4801
Year： 2015
Issue： 4
Volume： 29
Page： 1988-1998
0 . 7 9 3
JCR@2015
0 . 9 0 0
JCR@2023
ESI Discipline： ENGINEERING;
ESI HC Threshold：183
JCR Journal Grade：3
CAS Journal Grade：4
Cited Count：
WoS CC Cited Count： 11
SCOPUS Cited Count： 12
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 8
Affiliated Colleges：
