Cancellative hypergraphs and Steiner triple systems
Combinatorics
2021-03-30 v3
Abstract
A triple system is cancellative if it does not contain three distinct sets such that the symmetric difference of and is contained in . We show that every cancellative triple system that satisfies certain inequality between the sizes of and its shadow must be structurally close to the balanced blowup of some Steiner triple system. Our result contains a stability theorem for cancellative triple systems due to Keevash and Mubayi as a special case. It also implies that the boundary of the feasible region of cancellative triple systems has infinitely many local maxima, thus giving the first example showing this phenomenon.
Cite
@article{arxiv.1912.11917,
title = {Cancellative hypergraphs and Steiner triple systems},
author = {Xizhi Liu},
journal= {arXiv preprint arXiv:1912.11917},
year = {2021}
}
Comments
minor changes