The Cameron-Erdos Conjecture
| dc.creator | Green, Ben | |
| dc.date | 2003-04-04 | |
| dc.date.accessioned | 2026-07-07T04:56:37Z | |
| dc.date.available | 2026-07-07T04:56:37Z | |
| dc.description | A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)). | |
| dc.description | 11 pages, to appear in Bull. London Math. Soc | |
| dc.identifier | https://arxiv.org/abs/math/0304058 | |
| dc.identifier | http://arxiv.org/abs/math/0304058 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66986 | |
| dc.subject | Number Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 11B75 | |
| dc.title | The Cameron-Erdos Conjecture | |
| dc.type | text |