On a probabilistic generalization of Taylor's theorem
β Scribed by Gwo Dong Lin
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 308 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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.
## 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)/(__
Let 9 be the polyhedron given by 9 = {x E R": Nx=O, a~x~b}, where N is a totally unimodular matrix and a and 6 are any integral vectors. For x E R" let (x)' denote the vector obtained from x by changing all its negative components to zeros. Let x1, . . . , xp be the integral points in 9 and let 9+ b