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

DOI10.2307/2038986zbMath0248.10041OpenAlexW4244218849MaRDI QIDQ5661979

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)

Related Items (4)

Sum-Free Sets of Integers ⋮ On Sum-Free Subsequences ⋮ Sum-avoiding sets in groups ⋮ On Sum-Free Subsequences

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