Metraipolis › archive › dc_fb7abe149098

Spectral radius and size conditions for 1-tough balanced bipartite graphs to contain a $k$-factor with $k\ge 3$ — arXiv:2611.02615

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02615
License (as archived)
CC0-1.0
Archived
2026-11-03T11:37:35.205Z
SHA-256 of the archived text
e95c1980158c81f7ff88761654e7a475a0f2defcc777654fe33727856c60ab9b
Stable URL of this page
https://metraipolis.com/documento/dc_fb7abe149098

How to cite

Spectral radius and size conditions for 1-tough balanced bipartite graphs to contain a $k$-factor with $k\ge 3$ — arXiv:2611.02615 — arXiv (en), https://arxiv.org/abs/2611.02615 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb7abe149098 (Metraipolis archive dc_fb7abe149098, sha256 e95c1980158c81f7ff88761654e7a475a0f2defcc777654fe33727856c60ab9b)
BibTeX
@misc{dcfb7abe149098,
  title = {Spectral radius and size conditions for 1-tough balanced bipartite graphs to contain a $k$-factor with $kge 3$ — arXiv:2611.02615},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02615},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb7abe149098; sha256 e95c1980158c81f7ff88761654e7a475a0f2defcc777654fe33727856c60ab9b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02615. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The largest eigenvalue of the adjacency matrix $A(G)$ of a graph $G$ is called the spectral radius $\rho(G)$ of $G$. If $S$ is a vertex cut of a connected graph $G$, then $c(G-S)$ denotes the number of connected components of $G-S$. The toughness $t(G)$ of a graph $G$ is defined as $t(G) = \min\left\{\frac{|S|}{c(G-S)}: S \subset V(G), \text{ and } c(G-S) > 1\right\}$. A graph \( G \) is \( t \)-tough if \( |S| \ge t c(G - S) \) for every proper subset \( S \subset V(G) \) satisfying \( c(G - S) > 1 \). Combining the toughness and spectral conditions, we provide spectral radius and size conditions for the existence of $k$-factors in 1-tough balanced bipartite graphs. This settles a problem posed by Chen, Fan and Lin in [Discrete Appl. Math. {\bf 355} (2024), 223--231].

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.02615 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.305Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).