𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Turán problem for projective geometries

✍ Scribed by Peter Keevash

Book ID
108167141
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
311 KB
Volume
111
Category
Article
ISSN
0097-3165

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 ..

Multicolour Turán problems
Multicolour Turán problems
✍ Peter Keevash; Mike Saks; Benny Sudakov; Jacques Verstraëte 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 324 KB
Turán problems for integer-weighted grap
Turán problems for integer-weighted graphs
✍ Zoltán Füredi; André Kündgen 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

## Abstract A multigraph is (__k__,__r__)‐dense if every __k__‐set spans at most __r__ edges. What is the maximum number of edges ex~ℕ~(__n__,__k__,__r__) in a (__k__,__r__)‐dense multigraph on __n__ vertices? We determine the maximum possible weight of such graphs for almost all __k__ and __r__ (e