Pith. sign in

REVIEW 4 cited by

Strong stability from vertex-extendability and applications in generalized Tur\'{a}n problems

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

arxiv 2406.05748 v1 pith:WZA53UBO submitted 2024-06-09 math.CO

classification math.CO
keywords citeproblemsextremalgeneralizedresultsstabilityvertex-extendabilityapplications
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Extending the work of Liu--Mubayi--Reiher~\cite{LMR23unif} on hypergraph Tur\'{a}n problems, we introduce the notion of vertex-extendability for general extremal problems on hypergraphs and develop an axiomatized framework for proving strong stability for extremal problems satisfying certain properties. This framework simplifies the typically complex and tedious process of obtaining stability and exact results for extremal problems into a much simpler task of verifying their vertex-extendability. We present several applications of this method in generalized Tur\'{a}n problems including the Erd\H{o}s Pentagon Problem, hypergraph Tur\'{a}n-goodness, and generalized Tur\'{a}n problems of hypergraphs whose shadow is complete multipartite. These results significantly strengthen and extend previous results of Erd\H{o}s~\cite{Erdos62}, Gy\H{o}ri--J\'{a}nos--Simonovits~\cite{GPS91}, Grzesik~\cite{Gre12}, Hatami--Hladk\'{y}--Kr\'{a}\v{l}--Norine--Razborov~\cite{HHKNR13}, Morrison--Nir--Norin--Rz\k{a}\.{z}ewski--Wesolek~\cite{MNNRPW23}, Gerbner--Palmer~\cite{GP22}, and others.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Exact Tur\'{a}n number of the Fano plane in the $\ell_2$-norm

    math.CO 2025-07 conditional novelty 8.0 of 10

    For large n, the balanced complete bipartite 3-graph is the unique extremal construction for the ℓ2-norm Turán problem of the Fano plane, confirming a conjecture of Balogh-Clemen-Lidický.

  2. Spectral extremal problems for the $(p,Q)$-spectral radius of hypergraphs

    math.CO 2025-10 conditional novelty 7.0 of 10

    For p>1, the (p,Q)-spectral density of any hereditary hypergraph family equals its Q-density, yielding spectral Erdős-Pentagon and edge-critical Turán theorems for all p≥1.

  3. Tur\'{a}n density of tight cycles minus one edge in the $\ell_2$-norm

    math.CO 2025-07 conditional novelty 7.0 of 10

    The ℓ2-norm Turán density of the tight cycle minus one edge C_ℓ^{3-} is exactly 1/26 for every ℓ ≥ 5 with ℓ not divisible by 3, with a stability theorem.

  4. Spectral generalized Tur\'{a}n problems

    math.CO 2025-07 conditional novelty 6.0 of 10

    The paper introduces spectral generalized Turán numbers, proves a general transfer theorem from counting stability to spectral extremality, and derives a spectral Erdős Pentagon Theorem and an entropy formula.

Pith tools