Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
1 problem
showing 1–1
Suppose 17/30≤α≤1 and β>(2 α-1)/4 or 43/120≤α<17/30 and β>(5 α-2)/25 . For all sufficiently large n, a graph of order n in which each set of ⌊α n⌋ vertices spans at least β n^2 edges must contain a triangle.