REVIEW 1 cited by
A note on hypergraph extensions of Mantel's 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
A note on hypergraph extensions of Mantel's theorem
abstract
Chao and Yu introduced an entropy method for hypergraph Tur\'an problems, and used it to show that the family of $\lfloor k/2\rfloor$ $k$-uniform tents have Tur\'an density $k!/k^k$. Il'kovi\v{c} and Yan improved this by reducing to a subfamily of $\lceil k/e\rceil$ tents. In this note, enhancing Il'kovi\v{c}-Yan's result, we give a significantly shorter entropy proof, with optimal bounds within this framework.
Forward citations
Cited by 1 Pith paper
-
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.