✦ LIBER ✦

Turán-Ramsey problems

✍ Scribed by Béla Bollobás

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 278 KB
Volume: 156
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(96)00024-6

No coin nor oath required. For personal study only.

✦ Synopsis

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 ..... Fk) for the maximal size of a graph

📜 SIMILAR VOLUMES

On Ramsey-Turán type problems in tournam

On Ramsey-Turán type problems in tournaments

✍ A Bialostocki; N Sauer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Let Tbe a tournament and let c :e(T)--> {1 ..... r} be an r-colouring of the edges of T. The associated reachability graph, denoted by R(T, c) is a directed graph whose vertices are the vertices of T, and a vertex v of R(T, c) dominates a vertex u of R(T, c) iff there is a monochromatic directed pat

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 _

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

Explicit constructions of triple systems

Explicit constructions of triple systems for Ramsey–Turán problems

✍ Dhruv Mubayi; Vera T. Sós 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 68 KB

## Abstract We explicitly construct four infinite families of irreducible triple systems with Ramsey‐Turán density less than the Turán density. Two of our families generalize isolated examples of Sidorenko 14, and the first author and Rödl 12. Our constructions also yield two infinite families of i

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

A Turán type problem for interval graphs

✍ Harvey Abbott; Meir Katchalski 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 313 KB

We consider the following analogue of a problem of Turin for interval graphs: Let c = c(n, rn) be the largest integer such that any interval graph with n vertices and at least m edges contains a complete subgraph on c vertices. We determine the value of c(n, m) explicitly.