Minimum degree conditions for containing an r-regular r-connected subgraph
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 δ(G) n+r-22 when nr 0 2. This answers a question of M.~Kriesell.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.