✦ LIBER ✦

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

✍ Scribed by Dhruv Mubayi; Vera T. Sós

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 68 KB
Volume: 52
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20156

No coin nor oath required. For personal study only.

✦ Synopsis

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 irreducible triple systems whose Ramsey‐Turán densities are exactly determined. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 211–216, 2006

📜 SIMILAR VOLUMES

On the Turán Number of Triple Systems

✍ Dhruv Mubayi; Vojtêch Rödl 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 176 KB

For a family of r-graphs F; the Tur! a an number exðn; FÞ is the maximum number of edges in an n vertex r-graph that does not contain any member of F: The Tur! a an density When F is an r-graph, pðFÞ=0; and r > 2; determining pðFÞ is a notoriously hard problem, even for very simple r-graphs F: For