𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multicolour Turán problems

✍ Scribed by Peter Keevash; Mike Saks; Benny Sudakov; Jacques Verstraëte

Book ID
108047050
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
324 KB
Volume
33
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Turán-Ramsey problems
Turán-Ramsey problems
✍ Béla Bollobás 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 278 KB

For i = 1,2 .... ,k, let Gi be a graph with vertex set [n] = {1 .... ,n} containing no Fi as a subgraph. At most how many edges are in G1 t3 -• • U Gk? We shall answer this Turfin-Ramseytype question asymptotically, and pose a number of related problems. Given graphs F1 ..... Fk, write exk(n,F 1 ..

On a Ramsey-Turán type problem
On a Ramsey-Turán type problem
✍ Béla Bollobás; Paul Erdös 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 128 KB
Notes on a problem of Turán
Notes on a problem of Turán
✍ András Biró 📂 Article 📅 2001 🏛 Springer Netherlands 🌐 English ⚖ 272 KB