Sufficient conditions for even factors in graphs

Let $G$ be a graph. We denote by $e(G)$ and $\rho (G)$ the size and the spectral radius of $G$. A spanning subgraph $F$ of $G$ is called an even factor of $G$ if $d_F(v)\in \{2,4,6,\dots \}$ for every $v\in V(G)$. Yan and Kano provided a sufficient condition using the number of odd components in $G-S$ for a graph $G$ of even order to contain an even factor, where $S$ is a vertex subset of $G$ [Z. Yan, M. Kano, Strong Tutte type conditions and factors of graphs, Discuss. Math. Graph Theory 40 (2020) 1057–1065]. In this paper, motivated by Yan and Kano’s above result, we present some tight sufficient conditions to guarantee that a connected graph $G$ with the minimum degree $\delta$ contains an even factor with respect to its size and spectral radius.