Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908313644433408 |
|---|---|
| author | Kashima, Masaki |
| author_facet | Kashima, Masaki |
| contents | A claw-free graph is a graph that does not contain $K_{1,3}$ as an induced subgraph, and a 2-factor is a 2-regular spanning subgraph of a graph. In 1997, Ryjáček introduced the closure concept of claw-free graphs, and Hamilton cycles and related structures in claw-free graphs have been intensively studied via the closure concept. In this paper, using the closure concept, we show that for a claw-free graph $G$ of order $n$, if every independent set $I$ of $G$ satisfies $|I|\leq δ_G(I)-1$ and $G$ satisfies $σ_{k+1}(G)\geq n$, then $G$ has a 2-factor with at most $k$ cycles, where $δ_G(I)$ denotes the minimum degree of the vertices in $I$. As a corollary of the result, we show that every claw-free graph $G$ with $δ(G)\geq α(G)+1$ has a 2-factor with at most $α(G)$ cycles, which partially solves a conjecture by Faudree et al. in 2012. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_08268 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs Kashima, Masaki Combinatorics 05C07, 05C38 A claw-free graph is a graph that does not contain $K_{1,3}$ as an induced subgraph, and a 2-factor is a 2-regular spanning subgraph of a graph. In 1997, Ryjáček introduced the closure concept of claw-free graphs, and Hamilton cycles and related structures in claw-free graphs have been intensively studied via the closure concept. In this paper, using the closure concept, we show that for a claw-free graph $G$ of order $n$, if every independent set $I$ of $G$ satisfies $|I|\leq δ_G(I)-1$ and $G$ satisfies $σ_{k+1}(G)\geq n$, then $G$ has a 2-factor with at most $k$ cycles, where $δ_G(I)$ denotes the minimum degree of the vertices in $I$. As a corollary of the result, we show that every claw-free graph $G$ with $δ(G)\geq α(G)+1$ has a 2-factor with at most $α(G)$ cycles, which partially solves a conjecture by Faudree et al. in 2012. |
| title | Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs |
| topic | Combinatorics 05C07, 05C38 |
| url | https://arxiv.org/abs/2504.08268 |