REVIEW 2 cited by
On a hypergraph Mantel theorem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
On a hypergraph Mantel theorem
abstract
An $r$-graph is a triangle if there exists a positive integer $i \le \lceil r/2 \rceil$ such that it is isomorphic to the following $r$-graph with three edges: \begin{align*} \left\{\{1, \ldots, r\},~\{1, \ldots, i, r+1, \ldots, 2r-i\},~\{i+1, \ldots, r, r+1, 2r-i+1, \ldots,2r-1\}\right\}. \end{align*} We prove an Andr{\'a}sfai--Erd\H{o}s--S\'{o}s-type stability theorem for triangle-free $r$-graphs. In particular, it implies that for large $n$, the unique extremal triangle-free construction on $n$ vertices is the balanced complete $r$-partite $r$-graph. The latter result answers a question by Mubayi and Pikhurko~{\cite[Problem~20]{MPS11}} on weakly triangle-free $r$-graphs for large $n$ in a stronger form. The proof combines the recently introduced entropic technique of Chao--Yu~\cite{CY24} with the framework developed in~\cite{LMR23unif,HLZ24}.
Forward citations
Cited by 2 Pith papers
-
Tur\'an numbers of $4$-uniform tight even cycles minus one edge
ex(n, C_{4k+2}^{4-}) equals the number of edges in the complete odd-bipartite 4-graph for large n, and the Turán density of C_{4k+2}^4 is 1/2 for all k≥2 with stability.
-
Entropy methods in combinatorics
A selective survey of entropy methods in combinatorics, detailing randomized chain rules, Shearer's inequality, random homomorphisms, Pinsker-type arguments, the union-closed sets breakthrough, and entropy approaches ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.