Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MZM_2016_100_4_a13, author = {Yu. A. Demidovich and A. M. Raigorodskii}, title = {2-Colorings of {Uniform} {Hypergraphs}}, journal = {Matemati\v{c}eskie zametki}, pages = {623--626}, publisher = {mathdoc}, volume = {100}, number = {4}, year = {2016}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MZM_2016_100_4_a13/} }
Yu. A. Demidovich; A. M. Raigorodskii. 2-Colorings of Uniform Hypergraphs. Matematičeskie zametki, Tome 100 (2016) no. 4, pp. 623-626. http://geodesic.mathdoc.fr/item/MZM_2016_100_4_a13/
[1] P. Erdős, A. Hajnal, Acta Math. Acad. Sci. Hungar, 12:1-2 (1961), 87–123 | MR | Zbl
[2] P. Erdős, Nordisk Mat. Tidskr., 11 (1963), 5–10 | MR | Zbl
[3] P. Erdős, Acta Math. Acad. Sci. Hungar, 15:3-4 (1961), 445–447 | MR
[4] A. V. Kostochka, “Color-critical graphs and hypergraphs with few edges: a survey”, More Sets, Graphs and Numbers, Bolyai Soc. Math. Stud., 15, Springer-Verlag, Berlin, 2006, 175–197 | DOI | MR | Zbl
[5] A. M. Raigorodskii, D. A. Shabanov, UMN, 66:5 (2011), 109–182 | DOI | MR | Zbl
[6] J. Radhakrishnan, A. Srinivasan, Random Structures Algorithms, 16:1 (2000), 4–32 | 3.0.CO;2-2 class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR | Zbl
[7] D. D. Cherkashin, J. Kozik, Random Structures Algorithms, 47:3 (2015), 407–413 | DOI | MR | Zbl
[8] D. A. Shabanov, DAN, 402:5 (2005), 605–608 | Zbl
[9] D. A. Shabanov, Izv. RAN Ser. matem., 71:6 (2007), 183–222 | DOI | MR | Zbl
[10] D. A. Shabanov, Matem. sb., 199:7 (2008), 139–160 | DOI | MR | Zbl
[11] S. M. Teplyakov, Matem. zametki, 93:1 (2013), 148–151 | DOI | MR | Zbl
[12] A. P. Rozovskaya, DAN, 429:3 (2009), 309–311 | MR | Zbl
[13] A. P. Rozovskaya, Matem. zametki, 90:4 (2011), 584–598 | DOI | MR | Zbl