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

08/17/2021

∙

by   Max Hahn-Klimroth, et al.

∙

0

∙

share

We study optimal minimum degree conditions when an n-vertex graph G contains an r-regular r-connected subgraph. We prove for r fixed and n large the condition to be δ(G) ≥n+r-2/2 when nr ≡ 0 2. This answers a question of M. Kriesell.