| p-arrangeable Graphs are Folkman Linear |
| |
| 作者姓名： | Xun CHEN Qi-zhong LIN |
| |
| 作者单位： | Center for Discrete Mathematics |
| |
| 基金项目： | supported by NSFC(No.11671088);“New century excellent talents support plan for institutions of higher learning in Fujian province”(SJ2017-29). |
| |
| 摘 要： | 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.
|
| 关 键 词： | Folkman number Folkman linear Multi-partite regularity lemma |
p-arrangeable Graphs are Folkman Linear |
| |
| Xun CHEN,Qi-zhong LIN.p-arrangeable Graphs are Folkman Linear[J].Acta Mathematicae Applicatae Sinica,2021,37(1):69-74. |
| |
| Authors: | Chen Xun Lin Qi-zhong |
| |
| Institution: | 1.Center for Discrete Mathematics, Fuzhou University, Fuzhou, 350108, China
; |
| |
| Abstract: | Acta Mathematicae Applicatae Sinica, English Series - 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)... |
| |
| Keywords: | |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
