The Largest Sum-Free Subsequence from a Sequence of n Numbers

DOI10.2307/2038986MaRDI QIDQ5661979zbMATH OpenOpenAlexFDO

Authors S. L. G. Choi

Publication date 1973

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2038986

zbMATH Keywords

Erdős problemextremal problemlargest sum-free subsequence

Mathematics Subject Classification ID

Extremal set theory (05D05) Other combinatorial number theory (11B75)

Recommendations

• On Sequences Not Containing a Large Sum-Free Subsequence
• On Sum-Free Subsequences
• On Sum-Free Subsequences
• Subsequence sums of zero-sum-free sequences
• Approximating the maximum consecutive subsums of a sequence
• On the number of subsequences with given sum
• On subsequence sums of a zero-sum free sequence
• On zero-sum subsequences of length not exceeding a given number
• The largest (k,\ell )-sum-free subsets
• The number of maximal sum-free subsets of integers

Cited in

(7)

• Approximating the maximum consecutive subsums of a sequence
• Sum-avoiding sets in groups
• Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence
• On Sum-Free Subsequences
• Sum-Free Sets of Integers
• On Sequences Not Containing a Large Sum-Free Subsequence
• On Sum-Free Subsequences

This page was built for publication: The Largest Sum-Free Subsequence from a Sequence of n Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661979)