Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.mccme.ru/dfc/2013/Program2/Shabanov_List_of_Publications.pdf Дата изменения: Mon Oct 7 13:06:42 2013 Дата индексирования: Sat Mar 1 22:06:33 2014 Кодировка: Поисковые слова: arp 220

List of publications Dmitry Shabanov Published in 2013
[Art31] A.B. Kupavskii, L.A. Ostroumova, D.A. Shabanov, P. Tetali, " The Distribution of Second Degrees in the Buckley­Osthus Random Graph Model" , Internet Mathematics . [Art30] D. A. Shabanov, " Coloring non-uniform hypergraphs without short cycles" , Graphs and Combinatorics . [Art29] D. A. Shabanov, " Van der Waerden function and colorings of uniform hypergraphs with large girth" , Doklady: Mathematics, 88:1 (2013), 473­ . 477

Published in 2012
[Art28] D. A. Shabanov, " Choosability in simple hypergraphs" , Moscow Journal of Combinatorics and Number Theory, 2:4 (2012), 357­380. [Art27] A. P. Rozovskaya, D. A. Shabanov, " Extremal problems for panchromatic colourings of uniform hypergraphs" , Discrete Mathematics and Applications, 22:2 (2012), 185­206 . [Art26] A. B. Kupavskii, D. A. Shabanov, " Colorings of uniform hypergraphs blatt with large girth" , Doklady: Mathematics, 85:2 (2012), 247­250 ZentralMATH . [Art25] D. A. Shabanov, " On a generalization of the Erd os­Lovґ problem" , asz Proceedings of MIPT, 4:1 (2012), 131­140 (in Russian). [Art24] D. A. Shabanov, " Random coloring method in the combinatorial problem of Erd and Lovґ , Random Structures and Algorithms, 40:2 (2012), os asz" blatt MathSciNet ZentralMATH 227 ­ 253 . [Art23] D. A. Shabanov, " On r-chromatic hypergraphs" , Discrete Mathematics, blatt MathSciNet ZentralMATH 312:2 (2012), 441-458 .

1


Published in 2011
[Art22] D. A. Shabanov, A. P. Rozovskaya, " On colorings of non-uniform hypergraphs without short cycles" , Electronic Notes in Discrete Mathematics, 38 (2011), 749-754 . [Art21] D. A. Shabanov, " Partial Steiner systems and random hypergraphs" , Contemporary problems of mechanics and mathematics, 7:1 (2011), 68­76 (in Russian). [Art20] D. A. Shabanov, " Van der Waerden's function and colourings of hypergraphs" , Izvestiya: Mathematics, 75:5 (2011), 1063­1091 MathSciNet ZentralMATH blatt . [Art19] A.M. Raigorodskii, D. A. Shabanov, " The Erd os­Ha jnal problem, its generalizations and related problems" , Russian Mathematical Surveys, blatt 66:5 (2011), 933­1002 MathSciNet ZentralMATH . [Art18] D. A. Shabanov, " On coloring uniform hypergraphs without 3-cycles" , Moscow Journal of Combinatorics and Number Theory, 1:2 (2011), 180­ blatt 206 ZentralMATH . [Art17] D. A. Shabanov, " On a generalization of Rubin's theorem" , Journal of blatt MathSciNet ZentralMATH Graph Theory, 67:3 (2011), 226­234 . [Art16] A. P. Rozovskaya, D. A. Shabanov, " Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph" , blatt Mathematical Notes, 89:6 (2011), 903­906 MathSciNet ZentralMATH .

Published in 2010
[Art15] A. P. Rozovskaya, D. A. Shabanov, " On proper colourings of hypergraphs using prescribed colours" , Discrete Mathematics and Applications, 20:4 blatt (2010), 391­409 MathSciNet ZentralMATH . [Art14] D. A. Shabanov, " Lower bounds for the number of edges in hypergraphs of certain classes" , Doklady Mathematics, 82:2 (2010), 705­708 MathSciNet ZentralMATH blatt . [Art13] D. A. Shabanov, " On the lower bound for van der Waerden functions" , Mathematical Notes, 87:6 (2009), 918­920 MathSciNet .

2


[Art12] D. A. Shabanov, " The existence of panchromatic colourings for uniform blatt hypergraphs" , Sbornik: Mathematics, 201:4 (2010), 607­630 MathSciNet ZentralMATH ads . [Art11] D. A. Shabanov, " Lower bounds in the combinatorial problem of Erds o blatt and Lovґ , Doklady Mathematics, 81:2 (2010), 286­288 MathSciNet ZentralMATH asz" .

Published in 2009
[Art10] A. P. Rozovskaya, M. V. Titova, D. A. Shabanov, " On balanced colorings of hypergraphs" , Journal of Mathematical Sciences, 169:5 (2010), 654 blatt 670 MathSciNet ZentralMATH . [Art09] D. A. Shabanov, A. P. Rozovskaya, " On the problem of Erd and Ha jnal os in the case of list colorings" , Electronic Notes in Discrete Mathematics, MathSciNet . 34 (2009), 387­391 [Art08] D. A. Shabanov, " On the chromatic number of finite systems of subsets" , blatt Mathematical Notes, 85:6 (2009), 902­905 MathSciNet ZentralMATH . [Art07] D. A. Shabanov, " Improvement of the lower bound in the Erd ­ os Ha jnal combinatorial problem" , Doklady Mathematics, 79:3 (2009), 349­ blatt 350 MathSciNet ZentralMATH .

Published in 2004­2008
[Art06] D. A. Shabanov, " Randomized algorithms for colourings of hypergraphs" , Sbornik: Mathematics, 199:7 (2008), 1089­1110 MathSciNet . [Art05] D. A. Shabanov, " Extremal problems for colourings of uniform hypergraphs" , Izvestiya: Mathematics, 71:6 (2007), 1253­1290 MathSciNet ZentralMATH blatt . [Art04] D. A. Shabanov, " On some extremal properties of hypergraph colorings" , ZentralMATH . blatt Electronic Notes in Discrete Mathematics, 29 (2007), 97­100 [Art03] D. A. Shabanov, " On the vertex number of almost bipartite hypergraphs" , Doklady Mathematics, 75:1 (2007), 25­27 MathSciNet . [Art02] D. A. Shabanov, " On colorings of hypergraphs" , Doklady Mathematics, 71:3 (2005), 438­442 MathSciNet .
3


[Art01] D. A. Shabanov, " On one combinatorial problem of Erd , Doklady os" blatt Mathematics, 69:3 (2004), 359­362 MathSciNet ZentralMATH .

4