REVIEW 3 cited by
Spectral 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
Spectral generalized Tur\'{a}n problems
read the original abstract
Combining two well-studied variants of the classical Tur\'{a}n problem, the generalized Tur\'{a}n problem and the spectral Tur\'{a}n problem, we introduce the spectral generalized Tur\'{a}n problem and establish a general theorem that extends the result of Keevash--Lenz--Mubayi~\cite{KLM14} on the spectral Tur\'{a}n problem in this broader setting. As a quick application, we obtain the spectral Erd\H{o}s Pentagon Theorem. We also introduce the notion of entropic density for generalized Tur\'{a}n problems, and show that it coincides with the generalized spectral radius, extending a recent result of Chao--Hans on entropic Tur\'{a}n density.
Forward citations
Cited by 3 Pith papers
-
The spectral inducibility of graphs
Introduces spectral inducibility of graphs and proves a multipartite reduction for the extremal graphs when the target graph F is complete multipartite, with the leading asymptotic equal to ordinary inducibility.
-
Generalized spectral Tur\'an problems for disjoint cliques
The kK_{r+1}-free n-vertex graph with maximum t-clique spectral radius is K_{k-1} joined to T_r(n-k+1) for sufficiently large n.
-
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.