Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MZM_2013_93_1_a14, author = {S. M. Teplyakov}, title = {Upper {Bound} in the {Erd\H{o}s--Hajnal} {Problem} of {Hypergraph} {Coloring}}, journal = {Matemati\v{c}eskie zametki}, pages = {148--151}, publisher = {mathdoc}, volume = {93}, number = {1}, year = {2013}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MZM_2013_93_1_a14/} }
S. M. Teplyakov. Upper Bound in the Erd\H{o}s--Hajnal Problem of Hypergraph Coloring. Matematičeskie zametki, Tome 93 (2013) no. 1, pp. 148-151. http://geodesic.mathdoc.fr/item/MZM_2013_93_1_a14/
[1] P. Erdős, A. Hajnal, Acta Math. Acad. Sci. Hungar, 12:1-2 (1961), 87–123 | MR | Zbl
[2] A. V. Kostochka, More Sets, Graphs and Numbers, Bolyai Soc. Math. Stud., 15, Springer-Verlag, Berlin, 2006, 175–197 | MR | Zbl
[3] A. M. Raigorodskii, D. A. Shabanov, UMN, 66:5 (2011), 109–182 | DOI | MR
[4] D. A. Shabanov, DAN, 396:2 (2004), 166–169 | MR | Zbl
[5] N. Alon, J. H. Spencer, “The Probabilistic Method”, Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley Sons, New York, 2000 | MR | Zbl
[6] D. D. Cherkashin, A. B. Kulikov, DAN, 436:3 (2011), 316–319 | MR | Zbl
[7] D. A. Shabanov, Izv. RAN. Ser. matem., 71:6 (2007), 183–222 | DOI | MR | Zbl
[8] D. A. Shabanov, Matem. sb., 199:7 (2008), 139–160 | DOI | MR
[9] A. P. Rozovskaya, DAN, 429:3 (2009), 309–311 | MR | Zbl
[10] S. M. Teplyakov, Tr. MFTI, 4:1(13) (2012), 141–150