A simple proof of a theorem of Bollobas and Leader

被引：5
|
作者：
Yu, HB [1 ]
机构：
[1] Univ Sci & Technol China, Dept Math, Hefei 230026, Anhui, Peoples R China
来源：
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 2003年 / 131卷 / 09期
关键词：
D O I：
10.1090/S0002-9939-03-07091-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
By using Scherk's lemma we give a simple combinatorial proof of a theorem due to Bollobas and Leader. For any sequence of elements of an abelian group of order k, calling the sum of k terms of the sequence a k-sum, if 0 is not a k-sum, then there are at least r - k + 1 k-sums.
引用
收藏
页码：2639 / 2640
页数：2
相关论文
共 50 条
12345