|
Organizers |
Extremal pattern-free sets of integers, and other favorite problems of Erdös
by
Ronald Graham
UCSD
We will describe various problems in extremal number theory of the following type: What is the largest subset of [1, n] which does not contain the set x, 2x, 3x for any integer x?
Date received: March 17, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caew-32.