References
P. Erdős and A. Hajnal, Acta Math. Acad. Sci. Hungar 12(1–2), 87 (1961).
P. Erdős, Nordisk Mat. Tidskr. 11, 5 (1963).
P. Erdős, Acta Math. Acad. Sci. Hungar 15(3–4), 445 (1964).
A. Kostochka, in More Sets, Graphs and Numbers, Bolyai Soc. Math. Stud. (Springer-Verlag, Berlin, 2006), Vol. 15, pp. 175–197.
J. Beck, Discrete Math. 24(2), 127 (1978).
J. Spencer, J. Combin. Theory Ser. A 30(1), 112 (1981).
J. Radhakrishnan and A. Srinivasan, Random Structures Algorithms 16(1), 4 (2000).
N. Alon, Graphs Combin. 1, 387 (1985).
A. Kostochka, Random Structures Algorithms 24(1), 1 (2004).
N. Alon and J. Spenser, The Probabilistic Method (Wiley, Chichester, 2000; BINOM, Laboratory of Knowledge, Moscow, 2007).
Author information
Authors and Affiliations
Additional information
Original Russian Text © D. A. Shabanov, 2009, published in Matematicheskie Zametki, 2009, Vol. 85, No. 6, pp. 951–954.
Rights and permissions
About this article
Cite this article
Shabanov, D.A. On the chromatic number of finite systems of subsets. Math Notes 85, 902–905 (2009). https://doi.org/10.1134/S0001434609050332
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434609050332