Generalization of a Theorem of Alexandroff
โ Scribed by T.V. Panchapagesan
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 271 KB
- Volume
- 189
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## 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)/(__
In this paper, we give a generalization of a well-known result of Dirac that given any k vertices in a k-connected graph where k 2, there is a circuit containing all of them. We also generalize a result of Ha ggkvist and Thomassen. Our main result partially answers an open matroid question of Oxley.
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 article we characterize the quasiโbarrelledness of the projective tensor product of a coechelon space of type one __k__ ^1^(__A__) with a Frรฉchet space, including homological conditions as exactness properties of the corresponding tensor product functor __k__ ^1^(__A__) ยท: โฑ โ