Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
95
click to vote
JCSS
2008
87
views
more
JCSS 2008
»
Finding large 3-free sets I: The small n case
15 years 2 months ago
Download
www.cs.umd.edu
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free....
William I. Gasarch, James Glenn, Clyde P. Kruskal
claim paper
Read More »