Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The number of (2,3)-sum-free subsets of { 1,...,n}

From MaRDI portal
Publication:2717623
Jump to:navigation, search

DOI10.4064/aa98-2-6zbMath0972.11012OpenAlexW2030136576MaRDI QIDQ2717623

Tomasz Schoen

Publication date: 17 June 2001

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa98-2-6


zbMATH Keywords

sum-free setsconjecture of Cameron and Erdős


Mathematics Subject Classification ID

Other combinatorial number theory (11B75)


Related Items (2)

On solution-free sets of integers ⋮ Enumerating solution-free sets in the integers




This page was built for publication: The number of (2,3)-sum-free subsets of { 1,...,n}

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2717623&oldid=15570807"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 12:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki