Proof. We first prove the paraconvexity of u ( X ) . Consider a, 6 , and y such that u(a) 5 y 5 u(b), and let E > 0. We use an approximate "approximate interval-28 Ztschr. f. math. Logik
A generalization of the intermediate factors theorem
β Scribed by Amos Nevo; Robert J. Zimmer
- Publisher
- Springer-Verlag
- Year
- 2002
- Tongue
- English
- Weight
- 639 KB
- Volume
- 86
- Category
- Article
- ISSN
- 0021-7670
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we give a more general sufficient condition for a degree sequence (di) to be realizable by a graph (without multiple edges and loops) containing a subgraph of specified degree sequence tki)\* When sequences (di) and (dim ki) are both realizable by graphs, it was shown earlier that the
## 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