Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.01266 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916836461772800 |
|---|---|
| author | Duan, Xinhui Lu, Lu |
| author_facet | Duan, Xinhui Lu, Lu |
| contents | The spectral Turán number $\spex(n, F)$ denotes the maximum spectral radius $ρ(G)$ of an $F$-free graph $G$ of order $n$. This paper determines $\spex\left(n, C_{2k+1}^{\square}\right)$ for all sufficiently large $n$, establishing the unique extremal graph. Here, $C_{2k+1}^{\square}$ is the odd prism -- the Cartesian product $C_{2k+1} \square K_2$ -- where the Cartesian product $G \square F$ has vertex set $V(G) \times V(F)$, and edges between $(u_1,v_1)$ and $(u_2,v_2)$ if either $u_1 = u_2$ and $v_1v_2 \in E(F)$, or ($v_1 = v_2$ and $u_1u_2 \in E(G)$). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_01266 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Spectral extremal problem for the odd prism Duan, Xinhui Lu, Lu Combinatorics 05C50 The spectral Turán number $\spex(n, F)$ denotes the maximum spectral radius $ρ(G)$ of an $F$-free graph $G$ of order $n$. This paper determines $\spex\left(n, C_{2k+1}^{\square}\right)$ for all sufficiently large $n$, establishing the unique extremal graph. Here, $C_{2k+1}^{\square}$ is the odd prism -- the Cartesian product $C_{2k+1} \square K_2$ -- where the Cartesian product $G \square F$ has vertex set $V(G) \times V(F)$, and edges between $(u_1,v_1)$ and $(u_2,v_2)$ if either $u_1 = u_2$ and $v_1v_2 \in E(F)$, or ($v_1 = v_2$ and $u_1u_2 \in E(G)$). |
| title | Spectral extremal problem for the odd prism |
| topic | Combinatorics 05C50 |
| url | https://arxiv.org/abs/2507.01266 |