## Abstract Let ${\cal F}$ be a __k__‐uniform hypergraph on __n__ vertices. Suppose that $|F\_{1}\cap \cdots \cap F\_{r}|\ge t$ holds for all $F\_{1},\ldots ,F\_{r}\in {\cal F}$. We prove that the size of ${\cal F}$ is at most ${{n-t}\choose {k-t}}$ if $p= {k \over n}$ satisfies and __n__ is suffi
Smoothness Theorems for Erdős Weights, II
✍ Scribed by S.B Damelin
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 153 KB
- Volume
- 97
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
✦ Synopsis
We obtain new characterizations of smoothness, saturation results, and existence theorems of derivatives for weighted polynomials associated with Erdo s weights on the real line. Our methods rely heavily on realization functionals.
📜 SIMILAR VOLUMES
Let \(W:=e^{-Q}\) where \(Q\) is even, sufficiently smooth, and of faster than polynomial growth at infinity. Such a function \(W\) is often called an Erdös weight. In this paper we prove Nikolskii inequalities for Erdös weights. We also motivate the usefulness of, and prove a Bernstein inequality o
For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .