Notes on sum-free and related sets

被引：16
|
作者：
Cameron, PJ
Erdos, P
机构：
[1] Univ London Queen Mary & Westfield Coll, Sch Math Sci, London E1 4NS, England
[2] Hungarian Acad Sci, Inst Math, H-1364 Budapest, Hungary
来源：
COMBINATORICS PROBABILITY & COMPUTING | 1999年 / 8卷 / 1-2期
关键词：
D O I：
10.1017/S0963548398003435
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Our main topic is the number of subsets of [1,n] which are maximal with respect to some condition such as being sum-free, having no number dividing another, etc. We also investigate some related questions.
引用
收藏
页码：95 / 107
页数：13
相关论文
共 50 条
12345