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 β¦
A generalization of a theorem of Albert on finite division rings
β Scribed by E.C Johnsen; D.L Outcalt; Adil Yaqub
- Publisher
- Elsevier Science
- Year
- 1970
- Tongue
- English
- Weight
- 284 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0021-8693
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 the generalization of a theorem of A.
β
JΓΌrgen Moser
π
Article
π
1958
π
John Wiley and Sons
π
English
β 667 KB
A generalization of Vizing's theorem on
β
Jason Fulman
π
Article
π
1994
π
Elsevier Science
π
English
β 205 KB
A theorem on cocongruence of rings
β
Daniel A. Romano
π
Article
π
1990
π
John Wiley and Sons
π
English
β 99 KB
Conversely, if y E 2, we have (32, E 9) (y + 2, A o + 2,). Therefore (y. 0) E C, i.e. y E ( a E A : (a, 0) E c).
A generalization of Plantholt's theorem
β
A. J. W. Hilton
π
Article
π
1986
π
John Wiley and Sons
π
English
β 152 KB
A generalization of TurΓ‘n's theorem
β
Benny Sudakov; Tibor SzabΓ³; H. Van Vu
π
Article
π
2005
π
John Wiley and Sons
π
English
β 94 KB
## Abstract In this paper, we obtain an asymptotic generalization of TurΓ‘n's theorem. We prove that if all the nonβtrivial eigenvalues of a __d__βregular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~βfree subgraph of __G__ contains approximately (__t__βββ2)/(__