A spectral Erd\H{o}s-P\'{o}sa Theorem

TL;DR

This paper establishes a spectral analogue of the Erdős-Pósa theorem, identifying the maximum spectral radius for graphs without k independent cycles, extending classical extremal graph results into spectral graph theory.

Contribution

The paper proves a spectral version of the Erdős-Pósa theorem, determining the maximum spectral radius for graphs avoiding k independent cycles, and characterizes extremal graphs as complete split graphs.

Findings

Spectral radius of extremal graphs equals that of the complete split graph S_{n,2k-1}.

Provides conditions on n and k for the spectral bound to hold.

Introduces a spectral perspective to classical extremal cycle problems.

Abstract

A set of cycles is called independent if no two of them have a common vertex. Let $S_{n, 2k-1}$ be the complete split graph, which is the join of a clique of size $2k-1$ with an independent set of size $n-2k+1$. In 1962, Erd\H{o}s and P\'{o}sa established the following edge-extremal result: for every graph $G$ of order $n$ which contains no $k$ independent cycles, where $k\geq2$ and $n\geq 24k$, we have $e(G)\leq (2k-1)(n-k),$ with equality if and only if $G\cong S_{n,2k-1}.$ In this paper, we prove a spectral version of Erd\H{o}s-P\'{o}sa Theorem. Let $k\geq1$ and $n\geq \frac{16(2k-1)}{\lambda^{2}}$ with $\lambda=\frac1{120k^2}$. If $G$ is a graph of order $n$ which contains no $k$ independent cycles, then $\rho(G)\leq \rho(S_{n,2k-1}),$ the equality holds if and only if $G\cong S_{n,2k-1}.$ This presents a new example illustration for which edge-extremal problems have spectral analogues. Finally, a related problem is proposed for further research.