A Note on Upper Bounds for Some Generalized Folkman Numbers
Abstract
We present some new constructive upper bounds based on product graphs for generalized vertex Folkman numbers. They lead to new upper bounds for some special cases of generalized edge Folkman numbers, including Fe(K3,K4-e; K5) ≤ 27 and Fe(K4-e,K4-e; K5) ≤ 51. The latter bound follows from a construction of a K5-free graph on 51 vertices, for which every coloring of its edges with two colors contains a monochromatic K4-e.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.