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

European Journal of Combinatorics(2024)

引用 0|浏览0
暂无评分
摘要
We study optimal minimum degree conditions when an n-vertex graph G contains an r-regular r-connected spanning subgraph. We prove for r fixed and n large the condition to be δ(G)≥n+r−22 when nr≡0(mod2). This answers a question of M. Kriesell.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要