Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference15 articles.
1. I. A. Akolzin and D. A. Shabanov, “Colorings of hypergraphs with large number of colors,” Discr. Math., 339, No. 12, 3020–3031.
2. E. D. Boyer, D. L. Kreher, S. P. Radziszowski, and A. Sidorenko, “On (n, 5, 3)-Turán systems,” Ars Combin., 37, 13–31 (1994).
3. D. Cherkashin and J. Kozik, “A note on random greedy coloring of uniform hypergraphs,” Random Struct. Algorithms, 47, No. 3, 407–413 (2015).
4. P. Erdős, “On a combinatorial problem, I,” Nordisk Mat. Tidskrift, 11, 5–10 (1963).
5. P. Erdős, “On a combinatorial problem, II,” Acta Math. Acad. Sci., 15, No. 3-4, 445–447 (1964).