𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Turán Number and Probabilistic Combinatorics

✍ Scribed by Alan J. Aw

Book ID
120446637
Publisher
Mathematical Association of America
Year
2012
Tongue
English
Weight
222 KB
Volume
119
Category
Article
ISSN
0002-9890

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On two Turán Numbers
On two Turán Numbers
✍ Jian Shen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB
Mean Ramsey–Turán numbers
Mean Ramsey–Turán numbers
✍ Raphael Yuster 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract A ρ‐mean coloring of a graph is a coloring of the edges such that the average number of colors incident with each vertex is at most ρ. For a graph __H__ and for ρ ≥ 1, the __mean Ramsey–Turán number RT__(__n, H,ρ − mean__) is the maximum number of edges a ρ‐__mean__ colored graph with _

Upper Bounds for Turán Numbers
Upper Bounds for Turán Numbers
✍ Alexander Sidorenko 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 549 KB

A system of r-element subsets (blocks) of an n-element set X n is called a Tura n (n, k, r)-system if every k-element subset of X n contains at least one of the blocks. The Tura n number T(n, k, r) is the minimum size of such a system. We prove upper estimates: + as n Ä , r Ä , k=(#+o(1))r, #>1.