BOUNDS ON THE VERTEX FOLKMAN NUMBER $F(4, 4; 5)$
Keywords:
Folkman graphs, Folkman numbersAbstract
For a graph $G$ the symbol $G\to(4,4)$ means that in every 2-coloring of the vertices of $G$ there exists a monochromatic $K_4$. For the vertex Folkman number \[ F(4,4;5)=\min\{|V(G)| : G\to(4,4)\ \mbox {and}\ K_5\not\subset G\} \] we show that $16\leqq F(4,4;5)\leqq35$.
Downloads
Published
2004-12-12
Issue
Section
Articles
How to Cite
BOUNDS ON THE VERTEX FOLKMAN NUMBER $F(4, 4; 5)$. (2004). Annual of Sofia University St. Kliment Ohridski. Faculty of Mathematics and Informatics, 96, 75-83. https://annual.uni-sofia.bg/index.php/fmi/article/view/162