Pith. sign in

REVIEW 5 cited by

Nondegenerate Tur\'{a}n problems under $(t,p)$-norms

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.15934 v1 pith:KV264MNE submitted 2024-06-22 math.CO

classification math.CO
keywords mathcalmathrmvaluedeterminegraphproblemtheoremsasymptotic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Given integers $r > t \ge 1$ and a real number $p > 0$, the $(t,p)$-norm $\left\lVert \mathcal{H} \right\rVert_{t,p}$ of an $r$-graph $\mathcal{H}$ is the sum of the $p$-th power of the degrees $d_{\mathcal{H}}(T)$ over all $t$-subsets $T \subset V(\mathcal{H})$. We conduct a systematic study of the Tur\'{a}n-type problem of determining $\mathrm{ex}_{t,p}(n,\mathcal{F})$, which is the maximum of $\left\lVert \mathcal{H} \right\rVert_{t,p}$ over all $n$-vertex $\mathcal{F}$-free $r$-graphs $\mathcal{H}$. We establish several basic properties for the $(t,p)$-norm of $r$-graphs, enabling us to derive general theorems from the recently established framework in~\cite{CL24} that are useful for determining $\mathrm{ex}_{t,p}(n,\mathcal{F})$ and proving the corresponding stability. We determine the asymptotic value of $\mathrm{ex}_{t,p}(n,H_{F}^{r})$ for all feasible combinations of $(r,t,p)$ and for every graph $F$ with chromatic number greater than $r$, where $H_{F}^{r}$ represents the expansion of $F$. In the case where $F$ is edge-critical and $p \ge 1$, we establish strong stability and determine the exact value of $\mathrm{ex}_{t,p}(n,H_{F}^{r})$ for all sufficiently large $n$. These results extend the seminal theorems of Erd\H{o}s--Stone--Simonovits, Andr\'{a}sfai--Erd\H{o}s--S\'{o}s, Erd\H{o}s--Simonovits, and a classical theorem of Mubayi. For the $3$-uniform generalized triangle $F_5$, we determine the exact value of $\mathrm{ex}_{2,p}(n,F_5)$ for all $p \ge 1$ and its asymptotic value for all $p \in [1/2, 1]\cup \{k^{-1} \colon k \in 6\mathbb{N}^{+}+\{0,2\}\}$. This extends old theorems of Bollob\'{a}s, Frankl--F\"{u}redi, and a recent result of Balogh--Clemen--Lidick\'{y}. Our proofs utilize results on the graph inducibility problem, Steiner triple systems, and the feasible region problem introduced by Liu--Mubayi.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 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. Convex Transference for Degree Powers in Extremal Set Systems

    math.CO 2026-07 accept novelty 7.0 of 10

    Full t-stars (resp. point-stars) uniquely maximize codegree and degree p-power sums for all real p≥2 among t-intersecting (resp. intersecting) families throughout the sharp EKR range.

  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. The $(t,p)$-Norm in Classical Extremal Problems

    math.CO 2026-08 accept novelty 6.0 of 10

    For large vertex sets, the paper determines the exact maximum of the (t,p)-norm and its unique extremal hypergraph in three classical settings: bounded matching number, k-intersecting families, and hypergraphs avoidin...

  5. 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