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) .
✦ LIBER ✦
A Common Extension of the Erdős–Stone Theorem and the Alon–Yuster Theorem for Unbounded Graphs
✍ Scribed by Yoshiyasu Ishigami
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 186 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Proof of a Conjecture of Bollobás and Ko
✍
Yoshiyasu Ishigami
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 242 KB
A characterization theorem for the evolu
✍
Giovanni Frosali; Cornelis V. M. van der Mee; Francesco Mugelli
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 148 KB
👁 1 views
## Abstract We consider a class of abstract evolution problems characterized by the sum of two unbounded linear operators __A__ and __B__, where __A__ is assumed to generate a positive semigroup of contractions on an L^1^‐space and B is positive. We study the relations between the semigroup generat