Hello everybody !! I ran into an interesting graph construction, which happened to be... easy as soon as one knew how to build a sum-free set ( a sum-free set is a subset S of [1..n] such that no a,b in S are such that (a+b) \in S ).
The problem being to find, given a integer n, a largest sum-free set, the paper sent me to a result of Behrend (http://planetmath.org/encyclopedia/BehrendsConstruction.html) which gives an existence result for an asymptotically large such set S. Would anyone know of a good construction for sum-free sets, which could be implemented in Sage ? Perhaps even some way to iterate over them (just dreaming) ? I could not write a Linear Program for this without feeling guilty toward number theoreticians.. Would anyone else be interested in having a Sage method to generate some good sum-free set given this integer n ? Thank you very muuuuuch ! :-) Nathann -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
