Bounds on the number of maximal sum-free sets

DOI10.1016/j.ejc.2009.03.015zbMath1189.05025OpenAlexW1972119463MaRDI QIDQ1039444

Guy Wolfovitz

Publication date: 30 November 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.015

zbMATH Keywords

maximal sum-free subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Ramsey theory (05D10)

Related Items

On maximal sum-free sets in abelian groups ⋮ A sharp bound on the number of maximal sum-free sets ⋮ The number of the maximal triangle-free graphs ⋮ On solution-free sets of integers ⋮ The number of maximal sum-free subsets of integers ⋮ Enumerating solution-free sets in the integers ⋮ Groups with few maximal sum-free sets

Cites Work

• Independent sets in quasi-regular graphs
• Independent sets in regular graphs and sum-free subsets of finite groups
• On the number of maximal sum-free sets
• Notes on Sum-Free and Related Sets
• THE CAMERON–ERDOS CONJECTURE
• The Number of Maximal Independent Sets in Triangle-Free Graphs