Skip to main content
Faculty of Mathematics and Informatics
Home
About Us
History
Academic Staff A-Z
Contact Us
Library
News
Latest News
Events
БГ
EN
Search form
Structure
Faculty Structure
General Assembly
Faculty Council
Dean
Vice-deans
Administration
Dean's Office
Department of Student Affairs
Department of Student Еducation
Academic staff, project and science work
Teachers in English
Finance and Accounting
Information Services Laboratory
Technical service
Departments
Students' Council
Studies
Academic programmes
Bachelor's programmes
Master's programmes
Doctoral degree programmes
ERASMUS+
Lifelong learning
Admission
Bachelor's Degree Programmes
Procedure
Programmes
Exams
Mathematical Guide
The new program at INSAIT
Tournaments and competitions for students
Master's Degree Programmes
Procedure
Exams
Current admission 2023/2024
Doctoral Degree Programmes
Procedure
Programmes by speciality
Exams
Lifelong Learning
Procedure
Qualification Programs
Research
Research structures and people
Laboratories
Centres
Laboratories
Library
Research groups
Doctoral students
Library
Students in research
Doctoral students
Events and Cooperation
Research groups
Scientific publications
Annual of the FMI
Dissertations
Information system Authors
Other publications
IS Authors
More publications
Research Projects
Internal - funded by SU
National Projects
International Projects
Projects Information system (in Bulgarian)
Research calls information
Research Memberships
EUMaster4HPC
Events and cooperation
FMI Colloquium
Conferences organized by FMI
FMI Spring Science Session
National conferences
International conferences
Links with research organizations
Faculty - Industry Relations
Research data bases – ISI, Scopus, …
Competitions
schools
National Networking Competition for students
National IT Olimpiad
universities
Home
Biblio
Biblio
Author
Title
Type
[
Year
]
Filters:
Author
is
Nedyalko Nenov
[Clear All Filters]
1999
Nedialkov E
,
Nenov N
. 1999.
Each 11-vertex graph without 4-cliques has a triangle-free 2-partition of vertices
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 91(Livre 1 - Mathématiques et Mecanique):127-147.
91-127-147.pdf
(2.18 MB)
2002
Nenov N
. 2002.
ON A CLASS OF VERTEX FOLKMAN GRAPHS
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 94:15-25.
94-015-025.pdf
(969.14 KB)
2003
Nenov N
. 2003.
COMPUTATION OF THE VERTEX FOLKMAN NUMBERS $F(2, 2, 2, 3; 5)$ AND $F(2, 3, 3; 5)$
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 95
0895.pdf
(27.97 KB)
95-071-082.pdf
(990.81 KB)
Nenov N
. 2003.
A GENERALIZATION OF A RESULT OF DIRAC
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 95
0795.pdf
(32.51 KB)
95-059-069.pdf
(955.8 KB)
2004
Nenov N
. 2004.
BOUNDS ON THE VERTEX FOLKMAN NUMBER $F(4, 4; 5)$
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 96
0796.pdf
(34.01 KB)
96-075-083.pdf
(589.79 KB)
Khadzhiivanov N
,
Nenov N
. 2004.
GENERALIZED TURAN’S GRAPH THEOREM
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 96
0696.pdf
(30.2 KB)
96-069-073.pdf
(372.07 KB)
Khadzhiivanov N
,
Nenov N
. 2004.
LETTER TO THE EDITOR. TURAN’S THEOREM AND MAXIMAL DEGREES
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 96
1696.pdf
(22.75 KB)
96-173-174.pdf
(123.19 KB)
Nenov N
. 2004.
LOWER BOUNDS FOR SOME RAMSEY NUMBERS
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 96
0896.pdf
(32.05 KB)
96-085-087.pdf
(182.5 KB)
2005
Khadzhiivanov N
,
Nenov N
. 2005.
BALANCED VERTEX SETS IN GRAPHS
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 97
0597.pdf
(61.04 KB)
97-081-095.pdf
(1.38 MB)
2008
Kolev N
,
Nenov N
. 2008.
On the 2-coloring diagonal vertex Folkman numbers with minimal possible clique number
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 98
98-101-126.pdf
(1.79 MB)
Kolev N
,
Nenov N
. 2008.
An example of a 16-vertex Folkman edge (3,4)-graph without 8-cliques
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 98
98-127-141.pdf
(1.38 MB)
2013
Nenov N
. 2013.
ON THE VERTEX FOLKMAN NUMBERS $F_v(\underbrace{2,...,2}_R;R-1)$ and $F_v(\underbrace{2,...,2}_R;R-2)$
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 101
101-005-017.pdf
(157.88 KB)
2017
Bikov A
,
Nenov N
. 2017.
LOWER BOUNDING THE FOLKMAN NUMBERS $F_v(a_1, . . . , a_s;m − 1)$
.
Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique. 104:39-53.
104-039-053.pdf
(191.72 KB)