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.
✦ LIBER ✦
On a Generalization of Rédei’s Theorem
✍ Scribed by András Gács
- Publisher
- Springer-Verlag
- Year
- 2003
- Tongue
- English
- Weight
- 207 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On a generalization of Rubin's theorem
✍
Dmitry A. Shabanov
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 89 KB
On a generalization of Bertrand's theore
✍
Shi Rong-chang; Mei Feng-xiang
📂
Article
📅
1993
🏛
Springer
🌐
English
⚖ 323 KB
A generalization of Vizing's theorem on
✍
Jason Fulman
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 205 KB
On a probabilistic generalization of Tay
✍
Gwo Dong Lin
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 308 KB
Topics on a generalization of Gershgorin
✍
F.O. Farid
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 933 KB
We construct two classes of 3 × 3 and 4 × 4 real symmetric matrices, and establish sufficient conditions for the spectrum of a matrix A in each class to be disjoint from its kth order Gershgorin region. This provides a partial answer to a question raised by Newman and Thompson. The problem of provid
A generalization of Plantholt's theorem
✍
A. J. W. Hilton
📂
Article
📅
1986
🏛
John Wiley and Sons
🌐
English
⚖ 152 KB