关于K_n-H_(2n+1)的升分解

On the Ascending Subgraph Decompositon of K n-H 2n+1

［１］中猜想：任意有正数条边的图都可以升分解．本文证明了Ｋｎ－Ｈ２ｎ＋１可以升分解，其中Ｈ２ｎ＋１表示至多有ｎ个顶点和２ｎ＋１条边的图，ｎ≥７．

Abstract Y.Alavi had defined a new subgraph decomposition in,that is the ascending subgraph decomposition. They also posed a conjecture: every graph of positive size has an ascending subgraph decomposition, In this paper it is proved that K n-H 2n+1 has an Ascending Subgraph Decomposition,where H 2n+1 is any graph with at most n vertices and 2n+1 edges( n≥7 ).