проф. Недялко Ненов
Завеждащ Катедра "Алгебра"

Образование:

Дипломна работа (Master Thesis):

"On multiply-transitive groups",
Московский Государственый Университет, 1971

Кандидатска дисертация (PhD):

"Графи на Рамзи и някои константи свързани с тях",
СУ "Св. Климент Охридски", 1980

Доктор на математическите науки:

Дисертация: "Extremal problems of graph colorings",
СУ "Св. Климент Охридски", 2005
Дисертация | Slides | Автореферат

Академични степени:

Доцент: СУ "Св. Климент Охридски", 1985,
Професор: СУ "Св. Климент Охридски", 2006

Научни интереси:

Екстремална теория на графите, теория на Рамзи

Научни проекти:

"Алгебрични структури и теория на графите",
дог. 85/17.04.2006 с фонд НИ към СУ "Св. Климент Охридски"

Контакт:

Тел:	8161 (вътр. 585)	ФМИ	Стая:	511	ФМИ
	8161 (вътр. 569)	ФзФ

Публикации след 2002г.:

1. Chromatic number of graphs and edge folkman numbers., C. R. Acad. Bulg. Sci., 63 (2010), № 8, 1103-1110, preprint: arXiv:0903.3812v1 [math.CO] 23 Mar 2009.
2. On the Vertex Folkman Numbers F_v(2,...,2;q)., Serdica Math.J., 35 (2009), 251-272, preprint: arXiv:0903.3812v1 [math.CO] 23 Mar 2009.
3. On the Vertex Folkman Number F_v(2,...,2;r-1) and F_v(2,...,2;r-2). Annuaire Univ. Sofia Fac. Math. Inform., submitted in 2007. Preprint: arXiv:0903.3151v [math. CO], 18 Mar 2009.
4. New upper bound for a class of vertex Folkman numbers. (with Kolev, N.), Electron. J. Combin. 13 (2006), #R14.
5. Folkman number F_e(3, 4; 8) is equal to 16. (with Kolev, N.) C. R. Acad. Bulg. Sci. 59 (2006), № 1, 25-30.
6. Improvement of graph theory Wei's inequality. Mathematics and Education. Proc. Thirty Fifth Spring Conf. Union Bulg. Math., Borovets, 2006, 191-194.
7. New recurrent inequality on a class of vertex Folkman numbers. (with Kolev, N.) Mathematics and Education. Proc. Thirty Fifth Spring Conf. Union Bulg. Math., Borovets, 2006, 164-168.
8. Extremal problems of graph colorings. Dr. Sci. Thesis, Sofia Univ., Sofia, 2005.
9. An example of a 16-vertex Folkman (3, 4)-graph without 8-cliques. (with Kolev, N.) Annuaire Univ. Sofia, Fac. Math. Inform. 98 (2008), 127-141.
10. On the 2-coloring diagonal vertex Folkman numbers with minimal possible clique number. (with Kolev, N.) Annuaire Univ. Sofia, Fac. Math. Inform. 98 (2008), 101-126.
11. Balanced vertex sets in graphs. (with Khadzhiivanov, N.) Annuaire Univ. Sofia Fac. Math. Inform. 97 (2005), 81-96.
12. Turan's Theorem and maximal degrees. (with Khadzhiivanov, N.) Annuaire Univ. Sofia Fac. Math. Inform. 96 (2004), 173-174.
13. Sequences of maximal degree vertices in graphs. (with Khadzhiivanov, N.) Serdica Math. J. 30 (2004), 96-102.
14. Saturated І-sequences in graphs. (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 57 (2004), n. 6, 49-54.
15. Lower bounds for some Ramsey numbers. Annuaire Univ. Sofia Fac. Math. Inform. 96 (2004), 85-87.
16. Generalized Turan's graphs theorem. (with Khadzhiivanov, N.) Annuaire Univ. Sofia Fac. Math. Inform. 96 (2004), 69-73.
17. Generalized r-partite graphs and Turan's Theorem. (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 57 (2004), n. 2, 19-24.
18. Bounds on the vertex Folkman numbers F(4, 4; 5). Annuaire Univ. Sofia Fac. Math. Inform. 96 (2004), 75-83.
19. On the triangle vertex Folkman numbers. Discrete mathematics 271 (2003), 327-334.
20. On a class of vertex Folkman numbers. Serdica Math. J. 28 (2002), 219-232.
21. Lower bound for a number of vertices of some vertex Folkman graphs, C. R. Acad. Bulg. Sci. 55 (2002), n. 4, 33-36.
22. Computation of the vertex Folkman numbers F(2, 2, 2, 4; 6) and F(2, 3, 4; 6). (with Nedialkov, E.) Electron. J. Combin. 9 (2002), #R9.

Всички научни публикации:
[ 1 стр. | 2 стр. | 3 стр. | 4 стр. | 5 стр. ] pdf формат

Научно-популярни публикации:
[ 1 стр. | 2 стр. ] pdf формат