N. Kolev

activity

20062011

most citedNew recurrent inequality on a class of vertex Folkman numbers

4 citations · 4 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2011

Upper bound on the edge Folkman number $F_{e} (3, 3, 3; 13)$

Nikolay Kolev

In this paper we discuss a class of combinatorial constants in Ramsey theory- edge Folkman numbers. We give an upper bound on one of them- the number F_e(3,3,3;13).

math.CO2010

Bounds on some edge Folkman numbers

Nikolay Rangelov Kolev

We give some bounds on edge Folkman numbers.

math.CO2008

New Upper Bound for the Edge Folkman Number Fe(3,5;13)

Nikolay Kolev

In this paper we prove that the edge Folkman number Fe(3,5;13) is not greater than 21.

math.CO2006★ 4 cited

New recurrent inequality on a class of vertex Folkman numbers

Nikolay Rangelov Kolev, Nedyalko Dimov Nenov

We give a new recurrent inequality on a class of vertex Folkman numbers.

math.CO2006

An example of a 16-vertex Folkman edge (3,4)-graph without 8-cliques

N. Kolev, N. Nenov

In this paper we prove a new upper bouhd on an edge Folkman number. In a previous paper we have proved that this bound is exact.