Triangle-free triple systems
Combinatorics
2024-05-28 v1
Abstract
There are four non-isomorphic configurations of triples that can form a triangle in a -uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already appeared in the literature in some different context. Here we systematically study all of these problems solving the new cases exactly or asymptotically. In many cases we also characterize the extremal constructions.
Keywords
Cite
@article{arxiv.2405.16452,
title = {Triangle-free triple systems},
author = {Peter Frankl and Zoltán Füredi and Ido Goorevitch and Ron Holzman and Gábor Simonyi},
journal= {arXiv preprint arXiv:2405.16452},
year = {2024}
}
Comments
44 pages, 4 figures