N. Nenov

activity

20062019

F_{e} (3, 3; 4)

is greater than 19

7 citations · 31 across the 16 of their papers we have counts for

collaborators

16 papers

math.CO2019

On the independence number of $(3, 3)$ -Ramsey graphs and the Folkman number $F_{e} (3, 3; 4)$

Aleksandar Bikov, Nedyalko Nenov

The graph $G$ is called a $(3, 3)$ -Ramsey graph if in every coloring of the edges of $G$ in two colors there is a monochromatic triangle. The minimum number of vertices of the $(3,…

math.CO2017

Lower bounding the Folkman numbers $F_{v} (a_{1}, ..., a_{s}; m - 1)$

Aleksandar Bikov, Nedyalko Nenov

For a graph $G$ the expression $G \to v (a_{1}, ..., a_{s})$ means that for every $s$ -coloring of the vertices of $G$ there exists $i \in {1, ..., s}$ such that th…

math.CO2016★ 7 cited

The edge Folkman number $F_{e} (3, 3; 4)$ is greater than 19

Aleksandar Bikov, Nedyalko Nenov

The set of the graphs which do not contain the complete graph on $q$ vertices $K_{q}$ and have the property that in every coloring of their edges in two colors there exist a monochro…

math.CO2015

On the vertex Folkman numbers $F_{v} (a_{1}, ..., a_{s}; m - 1)$ when $max {a_{1}, ..., a_{s}} = 6$ or $7$

Aleksandar Bikov, Nedyalko Nenov

Let $G$ be a graph and $a_{1}, ..., a_{s}$ be positive integers. Then $G \to v (a_{1}, ..., a_{s})$ means that for every coloring of the vertices of $G$ in $s$ colors th…

math.CO2015★ 3 cited

Modified vertex Folkman numbers

Aleksandar Bikov, Nedyalko Nenov

Let $a_{1}, ..., a_{s}$ be positive integers. For a graph $G$ the expression $G \to v (a_{1}, ..., a_{s})$ means that for every coloring of the vertices of $G$ in $s…

math.CO2015★ 4 cited

The vertex Folkman numbers $F_{v} (a_{1}, ..., a_{s}; m - 1) = m + 9$ , if $max {a_{1}, ..., a_{s}} = 5$

Aleksandar Bikov, Nedyalko Nenov

For a graph $G$ the expression $G \to v (a_{1}, ..., a_{s})$ means that for any $s$ -coloring of the vertices of $G$ there exists $i \in {1, ..., s}$ such that ther…

On the independence number of (3,3)-Ramsey graphs and the Folkman number Fe​(3,3;4)

Lower bounding the Folkman numbers Fv​(a1​,...,as​;m−1)

The edge Folkman number Fe​(3,3;4) is greater than 19

On the vertex Folkman numbers Fv​(a1​,...,as​;m−1) when max{a1​,...,as​}=6 or 7

Modified vertex Folkman numbers

The vertex Folkman numbers Fv​(a1​,...,as​;m−1)=m+9, if max{a1​,...,as​}=5

On the independence number of $(3, 3)$ -Ramsey graphs and the Folkman number $F_{e} (3, 3; 4)$

Lower bounding the Folkman numbers $F_{v} (a_{1}, ..., a_{s}; m - 1)$

The edge Folkman number $F_{e} (3, 3; 4)$ is greater than 19

On the vertex Folkman numbers $F_{v} (a_{1}, ..., a_{s}; m - 1)$ when $max {a_{1}, ..., a_{s}} = 6$ or $7$

The vertex Folkman numbers $F_{v} (a_{1}, ..., a_{s}; m - 1) = m + 9$ , if $max {a_{1}, ..., a_{s}} = 5$