Notes on Sum-Free and Related Sets

Peter J. Cameron; Paul Erdos

doi:10.1017/S0963548398003435

Notes on Sum-Free and Related Sets

Peter J. Cameron^*, Paul Erdos

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

18 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	95-107
Number of pages	13
Journal	Combinatorics Probability and Computing
Volume	8
Issue number	1-2
DOIs	https://doi.org/10.1017/S0963548398003435
Publication status	Published - 1 Jan 1999

Access to Document

10.1017/S0963548398003435

Cite this

@article{84e7b30d512b4bc5afe5c6f5b22b00a7,

title = "Notes on Sum-Free and Related Sets",

abstract = "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.",

author = "Cameron, {Peter J.} and Paul Erdos",

year = "1999",

month = jan,

day = "1",

doi = "10.1017/S0963548398003435",

language = "English",

volume = "8",

pages = "95--107",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "1-2",

}

TY - JOUR

T1 - Notes on Sum-Free and Related Sets

AU - Cameron, Peter J.

AU - Erdos, Paul

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0442296166&partnerID=8YFLogxK

U2 - 10.1017/S0963548398003435

DO - 10.1017/S0963548398003435

M3 - Article

AN - SCOPUS:0442296166

SN - 0963-5483

VL - 8

SP - 95

EP - 107

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 1-2

ER -

Notes on Sum-Free and Related Sets

Abstract

Access to Document

Other files and links

Fingerprint

Cite this