Публикации на Недялко Ненов

  1. A new estimation from below for the Graham-Spencer number N(3, 5). (in Russian) Serdica 6 (1980), 373-383.
  2. Up to isomorphism there exists only one minimal t-graph with nine vertices. (in Russian) God. Sofij. Univ., Fak. Mat. Mekh. 73 (1979), 169-184 (1986).
  3. On the number of nontrivial solutions of Fermat's equation xn + yn = zn in a Galois field. (in Russian) (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 32 (1979), 557-560.
  4. On the Ramsey (3, 4)-graphs. (in Russian) God. Sofij. Univ., Fak. Mat. Mekh. 73 (1979), 185-190 (1986).
  5. On the Graham-Spencer number (in Russian) (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 32 (1979), 155-158.
  6. On edgewise 2-colored graphs containing a monochromatic triangle. (in Russian) (with Khadzhiivanov, N.) Serdica, 303-305.
  7. t-graphs with clique number 4. (in Russian) (with Khadzhiivanov, N.) Mathematics and education in mathematics, Proc. 8th Spring Conf. Union Bulg. Math., Sunny Beach, 1979, 565-577 (1979).
  8. Sharpening of a theorem of Greenwood and Gleason on the colorings of the edges of a complete graph with nine vertices. (in Russian) (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 31 (1978), 631-633.
  9. On the existence of a minimal t-graph with nine vertices. (in Russian) Annuaire Univ. Sofia Fac. Math. Mech. 72 (1978), 271-276.
  10. The number of p-cliques in graphs with p-filters. (in Russian) (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 30 (1977), 1231-1234.
  11. On the maximum of the numbers of cliques in some graphs (with Khadzhiivanov, N.) Mathematics and education in mathematics, Proc. 6th Spring Conf. Union Bulg. Math., Sunny Beach, 1977, 131-134.
  12. Inequalities connected with graphs. (in Russian) (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 30 (1977), 635-638.
  13. Extremal problems for s-graphs and a theorem of Turan. (in Russian) (with Khadzhiivanov, N.) Serdica 3 (1977), 117-125.
  14. p-sequences of graphs and extremal properties of Turan graphs. (in Russian) (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 30 (1977), 635-638.
  15. On the maximum number of edges of a graph. (in Russian) (with Khadzhiivanov, N.) C. R. Acad. Bulg. Sci. 29 (1976), 1575-1578.
  16. On some colorings in two colors of the edges of the complete graph with nine vertices. (in Russian) (with Khadzhiivanov, N.) God. Sofij. Univ., Fak. Mat. Mekh. 71 (1976/1977), Part II, 92-115 (1986).
  17. Maximum of the number of cliques of some graphs. (in Russian) (with Khadzhiivanov, N.) God. Sofij. Univ., Fak. Mat. Mekh. 70 (1975), 23-26.
  18. A new proof of a theorem about the maximum number of p-cliques of graphs. (in Russian) (with Khadzhiivanov, N.) Annuaire Univ. Sofia Fac. Math. Mech. 70 (1975), 93-98.
  19. On the representation of the abstract wreath product of groups by permutations. (in Russian) God. Sofij. Univ., Fak. Mat. Mekh. (1972/1973), 565-572 (1976).
  20. On the multiply-transitive groups. (in Russian) God. Sofij. Univ., Fak. Mat. Mekh. 65 (1970/1971), 219-224 (1972).
ФМИ  |  Home  |  Top