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
Ramachandra and Natarajan conjectured a bound on the pairwise independent correlation gap in their 2025 Operations Research Letters paper. An explicit counterexample refutes it.
On the basis of experiments up to 5000 nodes, Papamanthou and Tollis conjectured a relation between the longest paths produced by their MaxSTN and MinSTN algorithms for st-orientations of biconnected graphs. A counterexample refutes it.