|
|
|
|
Список литературы
|
|
| |
| 1. |
Erdős P., Hajnal A., “On a property of families of sets”, Acta Math. Acad. Sci. Hung., 12 (1961), 87–123    |
| 2. |
Erdős P., “Some old and new problems in various branches of combinatorics”, Proc. 10th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, 1979, 19–37 |
| 3. |
Erdős P., “On a combinatorial problem. I”, Nordisk Mat. Tidskrift, 11 (1963), 5–10 |
| 4. |
Erdős P., “On a combinatorial problem. II”, Acta Math. Acad. Sci. Hung., 15 (1964), 445–447 |
| 5. |
Kostochka A. V., “Color-critical graphs and hypergraphs with few edges: a survey”, Bolyai Soc. Math. Stud., 15 (2006), 175–198 |
| 6. |
Schmidt W. M., “Ein kombinatorisches Problem von P. Erdős and A. Hajnal”, Acta Math. Acad. Sci. Hung., 15 (1964), 373–374 |
| 7. |
Beck J., “On a combinatorial problem of P. Erdős and L. Lovász”, Discrete Math., 17 (1977), 127–131 |
| 8. |
Beck J., “On 3-chromatic hypergraphs”, Discrete Math., 24 (1978), 127–137 |
| 9. |
Spencer J. H., “Coloring $n$-sets red and blue”, Combinatorial Theory Ser. A, 30 (1981), 112–113 |
| 10. |
Radhakrishnan J., Srinivasan A., “Improved bounds and algorithms for hypergraph two-coloring”, Random Structures and Algorithms, 16 (2000), 4–32 |
| 11. |
Alon N., “Hypergraphs with high chromatic number”, Graphs and Combinatorics, 1 (1985), 387–389 |
| 12. |
Kostochka A. V., “Coloring uniform hypergraphs with few colors”, Random Structures and Algorithms, 24 (2004), 1–10 |
| 13. |
Визинг В. Г., “Раскраска вершин графа в предписанные цвета”, Методы дискретного анализа в теории кодов и схем, 29, Институт математики СО АН СССР, Новосибирск, 1976, 3–10 |
| 14. |
Erdős P., Rubin A. L., Taylor H., “Choosability in graphs”, Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, 26, Arcata/Calif., 1980, 125–157 |
| 15. |
Erdős P., Lovász L., “Problems and results on 3-chromatic hypergraphs and some related questions”, Colloq. Math. Soc. Janos Bolyai, 10 (1975), 609–627 |
| 16. |
Szabo Z., “An application of Lovasz local lemma – a new lower bound for the van der Waerden number”, Random Structures and Algorithms, 1 (1990), 343–360 |
| 17. |
Grable B., Phelps K., Rödl V., “The minimum independence number for designs”, Combinatorica, 15 (1995), 175–185  |
| 18. |
Алон Н., Спенсер Дж., Вероятностный метод, Бином, Москва, 2007 |
