Premium
On a generalization of Rubin's theorem
Author(s) -
Shabanov Dmitry A.
Publication year - 2011
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20527
Subject(s) - mathematics , combinatorics , generalization , graph , extremal graph theory , discrete mathematics , line graph , voltage graph , mathematical analysis
The work is devoted to the calculation of asymptotic value of the choice number of the complete r ‐partite graph K m* r = K m , …, m with equal part size m . We obtained the asymptotics in the case ln r = o (ln m ). 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom