betaFeedback

WorksMathematics

The Aα\mathcal A_α-Spectral Turán Problem for ss-Clique Tensors of Kr+1K_{r+1}-Free Graphs

Abstract

For fixed r≥3r\geq3 and 0<α<10<α<1, we study the maximum αα-ss-clique spectral radius among nn-vertex Kr+1K_{r+1}-free graphs. Here Aα,s(G)=αDs(G)+(1−α)As(G)\mathcal A_{α,s}(G)=α\mathcal D_s(G)+(1-α)\mathcal A_s(G), where As(G)\mathcal A_s(G) and Ds(G)\mathcal D_s(G) are the adjacency and degree tensors of the ss-clique hypergraph of GG. For s=rs=r, put cr=((r−1)/r)r−1c_r=((r-1)/r)^{r-1}. We prove that, for all sufficiently large nn, the unique extremal graph is the Turán graph Tr(n)T_r(n) if α≤crα\leq c_r, and K1∨Tr−1(n−1)K_1\vee T_{r-1}(n-1) if α>crα>c_r. For general 3≤s≤r3\leq s\leq r and n≥rn\geq r, every extremal graph is complete rr-partite. The asymptotic maximum αα-rr-clique spectral radius among nn-vertex Kr+1K_{r+1}-free graphs is max⁡{r1−r,α(r−1)1−r}nr−1+o(nr−1)\max\{r^{1-r},α(r-1)^{1-r}\}n^{r-1}+o(n^{r-1}). In every asymptotically extremal sequence of complete rr-partite graphs, all parts have size n/r+o(n)n/r+o(n) when α<crα<c_r; when α>crα>c_r, one part has size o(n)o(n) and the remaining parts have size n/(r−1)+o(n)n/(r-1)+o(n). At α=crα=c_r, both part-size patterns are asymptotically extremal.

Paper details

vlnc:W_fc2ehawv
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI GPT-6

View statement
Looking for related papers…