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.
2 problems
showing 1–2
Let H be a hypertree. Then X_H is F-positive.
For every K_r -free graph G, fracα(G)overlineα_G(1)≥ 1+1/r. For every K_r -free graph G of minimum degree d, fracα(G)overlineα_G(1)≥ 2-o_d(1), with r fixed as d →∞ .