Year: 2026
Type: preprint
Abstract: For every fixed $r\ge3$ and all sufficiently large $n$, we determine the largest adjacency spectral radius of an $n$-vertex graph with fewer than $q c_r(n)$ copies of $K_{r+1}$, where $1\le q
Source: arXiv (Cornell University)
Institution: Jiangsu Normal University
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: G2405134708, G5861376312
OpenAlex ID: W7220469054