## Abstract

Cameron and Erdos raised the question of how many maximal sum-free sets there are in {1,..., n}, giving a lower bound of 2^(n/4) . In this paper we prove that there are in fact at most 2^((1/4+o(1))n) maximal sum-free sets in {1,..., n}.

Our proof makes use of container and removal lemmas of Green as well as a result of Deshouillers, Freiman, Sos and Temkin on the structure of sum-free sets.

Our proof makes use of container and removal lemmas of Green as well as a result of Deshouillers, Freiman, Sos and Temkin on the structure of sum-free sets.

Original language | English |
---|---|

Pages (from-to) | 4713-4722 |

Number of pages | 10 |

Journal | Proceedings of the American Mathematical Society |

Volume | 143 |

Issue number | 11 |

Early online date | 2 Apr 2015 |

DOIs | |

Publication status | Published - Nov 2015 |