p-arrangeable Graphs are Folkman Linear

• 作者: Xun CHEN Qi-zhong LIN
• 来源期刊: 应用数学学报（英文版）
• 年，卷（期）: 2021,（1）
• 页码范围: 69-74
• 页数: 6页
• 语种: 英文

摘要

For graphs F and G,let F →(G,G)denote that any red/blue edge coloring of F contains a monochromatic G.Define Folkman number f(G;t)to be the smallest order of a graph F such that F-?(G,G)and ω(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.