共查询到20条相似文献,搜索用时 78 毫秒
1.
2.
3.
4.
5.
6.
7.
8.
Jonathan Lenchner 《Discrete Applied Mathematics》2011,159(7):612-620
9.
Improved bounds for acyclic chromatic index of planar graphs 总被引:1,自引:0,他引:1
10.
11.
12.
13.
14.
15.
16.
Jin-Hui Fang 《Discrete Applied Mathematics》2008,156(15):2950-2958
It is conjectured by Erd?s, Graham and Spencer that if 1≤a1≤a2≤?≤as are integers with , then this sum can be decomposed into n parts so that all partial sums are ≤1. This is not true for as shown by a1=?=an−2=1, . In 1997 Sandor proved that Erd?s-Graham-Spencer conjecture is true for . Recently, Chen proved that the conjecture is true for . In this paper, we prove that Erd?s-Graham-Spencer conjecture is true for . 相似文献
17.
18.
19.