𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Ramsey-Turán numbers of graphs and hypergraphs

✍ Scribed by József Balogh, John Lenz

Book ID
120953153
Publisher
The Hebrew University Magnes Press
Year
2012
Tongue
English
Weight
488 KB
Volume
194
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On ramsey-tuŕan numbers for 3-graphs
On ramsey-tuŕan numbers for 3-graphs
✍ A. F. Sidorenko 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract For every __r__‐graph __G__ let π(__G__) be the minimal real number ϵ such that for every ϵ < 0 and __n__ ϵ __n__~0~(λ, __G__) every __R__‐graph __H__ with __n__ vertices and more than (π + ϵ)(nr) edges contains a copy of __G__. The real number λ(__G__) is defined in the same way, addin

A Ramsey-type problem and the Turán numb
A Ramsey-type problem and the Turán numbers
✍ N. Alon; P. Erdős; D. S. Gunderson; M. Molloy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract For each __n__ and __k__, we examine bounds on the largest number __m__ so that for any __k__‐coloring of the edges of __K~n~__ there exists a copy of __K~m~__ whose edges receive at most __k−__1 colors. We show that for $k \ge \sqrt{n}\;+\,\Omega(n^{1/3})$, the largest value of __m__ i

Multipartite Turán problem for connected
Multipartite Turán problem for connected graphs and hypergraphs
✍ Zsolt Tuza 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Tuza, Z., Multipartite Turan problem for connected graphs and hypergraphs, Discrete Mathematics 112 (1993) 199-206. Giving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum number of edges in a k-chromatic graph G with color classes of given cardinalities n,, , n,,

Turán Numbers of Subdivided Graphs
Turán Numbers of Subdivided Graphs
✍ Jiang, Tao; Seiver, Robert 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 313 KB