# A note on the number of $(k,l)$-sum-free sets.

The Electronic Journal of Combinatorics [electronic only] (2000)

- Volume: 7, Issue: 1, page Research paper R30, 8 p.-Research paper R30, 8 p.
- ISSN: 1077-8926

## Access Full Article

top## How to cite

topSchoen, Tomasz. "A note on the number of -sum-free sets.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper R30, 8 p.-Research paper R30, 8 p.. <http://eudml.org/doc/121050>.

@article{Schoen2000,

author = {Schoen, Tomasz},

journal = {The Electronic Journal of Combinatorics [electronic only]},

keywords = {sum-free sets},

language = {eng},

number = {1},

pages = {Research paper R30, 8 p.-Research paper R30, 8 p.},

publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},

title = {A note on the number of -sum-free sets.},

url = {http://eudml.org/doc/121050},

volume = {7},

year = {2000},

}

TY - JOUR

AU - Schoen, Tomasz

TI - A note on the number of -sum-free sets.

JO - The Electronic Journal of Combinatorics [electronic only]

PY - 2000

PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos

VL - 7

IS - 1

SP - Research paper R30, 8 p.

EP - Research paper R30, 8 p.

LA - eng

KW - sum-free sets

UR - http://eudml.org/doc/121050

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.