The Largest Sum-Free Subsequence from a Sequence of n Numbers (Q5661979): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2038986 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4244218849 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:34, 20 March 2024
scientific article; zbMATH DE number 3392581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Largest Sum-Free Subsequence from a Sequence of n Numbers |
scientific article; zbMATH DE number 3392581 |
Statements
The Largest Sum-Free Subsequence from a Sequence of n Numbers (English)
0 references
1973
0 references
largest sum-free subsequence
0 references
extremal problem
0 references
Erdős problem
0 references
