论文信息 - On a generalization of Rubin's theorem

On a generalization of Rubin's theorem

The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph Km* r = Km, …, m with equal part size m. We obtained the asymptotics in the case lnr = o(lnm). The proof generalizes the classical result of A.L. Rubin for the case r = 2. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 226–234, 2011 67: 226-234, 2011 © 2011 Wiley Periodicals, Inc.

Dmitry A. Shabanov | D. Shabanov

[1] D. Shabanov,et al. Extremal problems for colourings of uniform hypergraphs , 2007 .

[2] Michael Krivelevich,et al. On the asymptotic value of the choice number of complete multi-partite graphs , 2006 .

[3] P. Erdos. On a combinatorial problem. II , 1964 .

[4] Miklós Bóna,et al. A Survey of Stack-Sorting Disciplines , 2003, Electron. J. Comb..

[5] Andras Hajnal,et al. On a property of families of sets , 1964 .

[6] S. Chowla. A theorem of Erdös , 1937 .

[7] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[8] Noga Alon,et al. Choice Numbers of Graphs: a Probabilistic Approach , 1992, Combinatorics, Probability and Computing.

[9] Dmitrii A Shabanov,et al. The existence of panchromatic colourings for uniform hypergraphs , 2010 .

[10] Hal A. Kierstead,et al. On the choosability of complete multipartite graphs with part size three , 2000, Discret. Math..

[11] Aravind Srinivasan,et al. Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[12] Alexandr V. Kostochka,et al. On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs , 2002, Electron. J. Comb..

[13] Aravind Srinivasan,et al. Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.