已收录 268921 条政策
 政策提纲
  • 暂无提纲
On Star Forest Ascending Subgraph Decomposition
[摘要] The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph $G$ with ${n+1\choose 2}$ edges admits an edge decomposition $G=H_1\oplus\cdots \oplus H_n$ such that $H_i$ has $i$ edges and it is isomorphic to a subgraph of $H_{i+1}$, $i=1,
[发布日期]  [发布机构] 
[效力级别]  [学科分类] 离散数学和组合数学
[关键词] Ascending graph decomposition [时效性] 
   浏览次数:11      统一登录查看全文      激活码登录查看全文