Embedding Graphs Having Ore-Degree at Most Five.

SIAM JOURNAL ON DISCRETE MATHEMATICS（2019）

引用 0|浏览27

暂无评分

摘要

Let H and G be graphs on n vertices, where n is sufficiently large. We prove that if H has Ore-degree at most 5 and G has minimum degree at least 2n/3, then H is a subgraph of G.

查看译文

关键词

embedding problems,Ore-degree,Bollobas-Eldridge-Catlin conjecture

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要