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 -vertex graph contains an -regular -connected subgraph. We prove for fixed and large the condition to be when . 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}
}