Sharp conditions for the existence of an even [a,b]-factor in a graph

DOI10.4134/BKMS.B191050MaRDI QIDQ4991404zbMATH OpenOpenAlexFDO

Authors Eun-Kyung Cho, Jong Yoon Hyun, Suil O, Jeong Rye Park

Publication date 3 June 2021

Full work available at URL https://arxiv.org/abs/1809.05260

zbMATH Keywords

b\)-factor]edge-connectivityeven \([aspectral radiusvertex-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Let $a$ and $b$ be positive integers. An even $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $vinV(G)$, $d_H(v)$ is even and $ale{d}_H(v)leb$. Matsuda conjectured that if $G$ is an $n$-vertex 2-edge-connected graph such that $nge2a+b+frac{a}^2-3ab-2$, $delta(G)gea$, and $sigm{a}_2(G)gefrac2ana+b$, then $G$ has an even $[a,b]$-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even $[a,b]$-factor. For even $an$, we conjecture a lower bound for $lambd{a}_1(G)$ in an $n$-vertex graph to have an $[a,b]$-factor, where $lambd{a}_1(G)$ is the largest eigenvalue of $G$.

Recommendations

• A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
• Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
• Even [a,b]-factors in graphs
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph

Cites work

• A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• An Ore-type condition for the existence of \(k\)-factors in graphs
• Eigenvalues and [a,b]‐factors in regular graphs
• Eigenvalues and \([1,n]\)-odd factors
• Even [a,b]-factors in graphs
• Graph factors
• scientific article; zbMATH DE number 1933054 (Why is no real title available?)
• Minimum degree of a graph and the existence of k-factors
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• Regular factors and eigenvalues of regular graphs
• Regular factors of regular graphs
• Regular factors of regular graphs from eigenvalues
• Regular graphs, eigenvalues and regular factors
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• The factorization of graphs. II
• The Factors of Graphs

Cited in

(29)

• Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
• Spectral radius and \([a,b]\)-factors in graphs
• A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• Even [a,b]-factors in graphs
• AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
• Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
• More on even [a,b]-factors in graphs
• Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
• Binding number, \(k\)-factor and spectral radius of graphs
• Turán-type problems on \([a, b]\)-factors of graphs, and beyond
• The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs
• Spectral radius and rainbow k-factors of graphs
• \(A_\alpha\)-spectral conditions for \((a, b, k)\)-factor-critical graphs and fractional \(ID\)-\([a, b]\)-factor-critical covered graphs
• Spectral conditions for k-extendability and k-factors of bipartite graphs
• Spectral radius, the matching number and fractional criticality of graphs
• Distance spectral conditions for \textit{ID}-factor-criticality and fractional \([a,b]\)-factor of graphs
• Spectral extremal problem on all (a, b, k)-critical graphs
• A spectral condition for Hamilton cycles in tough bipartite graphs
• Spectral conditions for a graph to have strong parity factors
• Bipartite binding number, k-factor and spectral radius of bipartite graphs
• Spectral radius and fractional \([a, b]\)-factor of graphs
• A note on the spectral radius and \([a,b]\)-factor of graphs
• Spectral conditions for graphs to contain k-factors
• Eigenvalues and factors: a survey
• Spectral radius and critical covered graphs
• Tight spectral and size conditions for (fractional) (a, b; k)-critical graphs

This page was built for publication: Sharp conditions for the existence of an even \([a,b]\)-factor in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4991404)