Turan and Ramsey numbers in linear triple systems
Andras Gyarfas, Gabor N. Sarkozy

TL;DR
This paper extends Turán and Ramsey number results from triangles to more complex triple configurations in linear triple systems, revealing new structural properties and unavoidable configurations in large hypergraphs.
Contribution
It generalizes Turán-type theorems to s-configurations and introduces extended s-configurations, establishing their Ramsey properties in Steiner triple systems.
Findings
Large linear triple systems contain s-configurations or extended s-configurations.
Most small unavoidable configurations are t-Ramsey, except possibly those with sail C_{15}.
The wicket D_4 is 1-Ramsey in all Steiner triple systems except the Fano plane.
Abstract
In this paper we study Tur\'an and Ramsey numbers in linear triple systems, defined as -uniform hypergraphs in which any two triples intersect in at most one vertex. A famous result of Ruzsa and Szemer\'edi is that for any fixed and large enough the following Tur\'an-type theorem holds. If a linear triple system on vertices has at least edges then it contains a {\em triangle}: three pairwise intersecting triples without a common vertex. In this paper we extend this result from triangles to other triple systems, called {\em -configurations}. The main tool is a generalization of the induced matching lemma from -patterns to more general ones. We slightly generalize -configurations to {\em extended -configurations}. For these we cannot prove the corresponding Tur\'an-type theorem, but we prove that they have the weaker, Ramsey property: they can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
