On the 2-coloring diagonal vertex Folkman numbers with minimal possible clique number

MaRDI QIDQ4993759zbMATH OpenFDO

Authors

Publication date 16 June 2021

Full work available at URL https://www.fmi.uni-sofia.bg/en/node/6796

zbMATH Keywords

Folkman graphsFolkman numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On the vertex Folkman numbers \(F_v(\underbrace{2,\dots,2}_R;R-1)\) and \(F_v(\underbrace{2,\dots,2}_R;R-2)\)
• On the Vertex Folkman Numbers F_v(2,...,2;q)
• On the lower bound for F_v(k,k;k+1) and F_e(3,4;5)
• On the 3-colouring vertex Folkman number F(2,2,4)
• New upper bounds for vertex Folkman numbers F_v(3,k;k+1)

Cited in

(3)

• Chromatic vertex Folkman numbers
• On the 3-colouring vertex Folkman number F(2,2,4)
• On the vertex Folkman numbers \(F_v(\underbrace{2,\dots,2}_R;R-1)\) and \(F_v(\underbrace{2,\dots,2}_R;R-2)\)

This page was built for publication: On the 2-coloring diagonal vertex Folkman numbers with minimal possible clique number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993759)