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

arxiv(2021)

引用 0|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
minimum degree conditions,subgraph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要