Triangle-Free Triple Systems
Abstract
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.
Fields of Study & Subjects
Mathematics and Applications
graph theory and CDMA systems
Cellular Automata and Applications
Publication details
- Journal / source
- The Electronic Journal of Combinatorics
- Volume
- 33
- Issue
- 2
- Publication date
- 21 May 2026
- Language
- EN