REVIEW 4 cited by
A Tur\'{a}n Type Problem Concerning the Powers of the Degrees of a Graph (revised)
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
abstract
For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with $n$ vertices that do not contain $H$ as a subgraph. Clearly, $t_{1}(n,H)$ is twice the Tur\'{a}n number of $H$. In this paper we consider the case $p>1$. For some graphs $H$ we obtain exact results, for some others we can obtain asymptotically tight upper and lower bounds, and many interesting cases remain open.
Forward citations
Cited by 4 Pith papers
-
Exact Tur\'{a}n number of the Fano plane in the $\ell_2$-norm
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ý.
-
Tur\'{a}n density of tight cycles minus one edge in the $\ell_2$-norm
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.
-
On cliques in hypergraphs under bounded $(j,p)$-norm
Determines the maximum number of t-cliques in n-vertex r-graphs with bounded (j,p)-norm when p>(t-j)/(r-j), proved via entropy plus interpolation and sharp for Steiner systems.
-
Phase transition of degenerate Tur\'{a}n problems in $p$-norms
For r-uniform hypergraphs, the p-norm Turán number ex_p(n,F) switches from a pseudorandom (n^{1+pα}) to a star-like (n^{p(r-1)}) regime at p = 1/(r-1-α), and the threshold case is solved for short even cycles and degr...
Discussion (0). Continue with ORCID to comment.