Triangle-Free Triple Systems
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already appeared in the literature. Here we systematically study all of these problems solving the new cases exactly or asymptotically. In many cases we also characterize the extremal constructions.
Authors
- Zoltán Füredi (ORCID: https://orcid.org/0000-0001-7335-991X)
- Ron Holzman (ORCID: https://orcid.org/0000-0002-4629-410X)
- Ido Goorevitch
- Gábor Simonyi (ORCID: https://orcid.org/0000-0003-0270-4565)
- Péter Frankl
Publication Details
- Journal
- The Electronic Journal of Combinatorics
- Published
- 2026-05-21
- DOI
- https://doi.org/10.37236/14115
- Primary Topic
- Mathematics and Applications
- Type
- preprint
- Field-Weighted Citation Impact
- 0.00
Funders
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
- National Research, Development and Innovation Office