Cancellative hypergraphs and Steiner triple systems

DOI10.1016/J.JCTB.2024.03.006MaRDI QIDQ6331852zbMATH OpenOpenAlexFDO

Authors Xizhi Liu

Publication date 26 December 2019

Full work available at URL https://doi.org/10.1016/j.jctb.2024.03.006

Mathematics Subject Classification ID

Triple systems (05B07) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Abstract: A triple system is cancellative if it does not contain three distinct sets $A,B,C$ such that the symmetric difference of $A$ and $B$ is contained in $C$. We show that every cancellative triple system $mathcalH$ that satisfies certain inequality between the sizes of $mathcalH$ 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.

Recommendations

• Stability theorems for cancellative hypergraphs
• Spectral Turán-type problems on cancellative hypergraphs
• A 2-stable family of triple systems
• Extremal problems for triple systems
• 2-cancellative hypergraphs and codes

Cited in

(4)

• Spectral Turán-type problems on cancellative hypergraphs
• Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
• Finite hypergraph families with rich extremal Turán constructions via mixing patterns
• Positive codegree Andrásfai-Erdős-Sós theorem for the generalized triangle

This page was built for publication: Cancellative hypergraphs and Steiner triple systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6331852)