Indexed by：
Abstract：
for graphs F and G, let F -＞ (G, G) denote that any red/blue edge coloring of F contains a monochromatic G. De ne Folkman number f(G; t) to be the smallest order of a graph F such that F -＞ (G, G) and omega(F) ＜= t. It is shown that f(G; t) ＜= cn for p-arrangeable graphs with n vertices, where p ＞= 1, c = c(p) and t = t(p) are positive constants.
Keyword：
Reprint 's Address：
Email：
Source ：
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
ISSN： 0168-9673
CN： 11-2041/O1
Year： 2021
Issue： 1
Volume： 37
Page： 69-74
0 . 6 9 1
JCR@2021
0 . 9 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：36
JCR Journal Grade：4
CAS Journal Grade：3
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 3
Affiliated Colleges：
