English

Minimum degree conditions for containing an $r$-regular $r$-connected subgraph

Combinatorics 2021-08-18 v1 Discrete Mathematics

Abstract

We study optimal minimum degree conditions when an nn-vertex graph GG contains an rr-regular rr-connected subgraph. We prove for rr fixed and nn large the condition to be δ(G)n+r22\delta(G) \ge \frac{n+r-2}{2} when nr0(mod2)nr \equiv 0 \pmod 2. This answers a question of M.~Kriesell.

Keywords

Cite

@article{arxiv.2108.07601,
  title  = {Minimum degree conditions for containing an $r$-regular $r$-connected subgraph},
  author = {Max Hahn-Klimroth and Olaf Parczyk and Yury Person},
  journal= {arXiv preprint arXiv:2108.07601},
  year   = {2021}
}
R2 v1 2026-06-24T05:11:15.597Z