2000 character limit reached
Minimum degree conditions for containing an $r$-regular $r$-connected subgraph
Published 17 Aug 2021 in math.CO and cs.DM | (2108.07601v1)
Abstract: 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 $\delta(G) \ge \frac{n+r-2}{2}$ when $nr \equiv 0 \pmod 2$. This answers a question of M.~Kriesell.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.