Edge Folkman numbers can be viewed as a generalization of more commonly studied Ramsey numbers. is defined as the smallest order of any -free graph such that any red-blue coloring of the edges of contains either a red or a blue . In this note, first we discuss edge Folkman numbers involving graphs , including the results , , and . Our modification of computational methods used previously in the study of classical Folkman numbers is applied to obtain upper bounds on for all .
"On some edge Folkman numbers, small and large." Involve 12 (5) 813 - 822, 2019. https://doi.org/10.2140/involve.2019.12.813