Get Started
Research questionHow can we certify optimality for a long-unsolved maximum independent-set benchmark?Finding a large independent set does not show that no larger set exists. A certificate must also provide a checkable upper bound matching the set’s size.
Evaluation & Benchmarks
Research Paper
Latest papersRecent research connected to this question, newest first.frb100-40 After Two Decades: An Optimality Certificate and a Preregistered Search StudyThe source studies the 4,000-vertex frb100-40 graph, providing a directly checkable independent set of size 100 and a verified partition into 100 cliques of size 40. It separately reports preregistered heuristic-search experiments, which found no new certificate or detectable acceleration on this instance; those results characterize the reported search barrier rather than establish broader solver performance.research paper · Sep 2, 2026
Related questions
How can robotics optimization efficiently certify candidate solutions despite degenerate semidefinite relaxations?How can computational systems discover graph-theoretic conjectures that survive refutation and admit machine-checked proofs?How can we test whether language models genuinely execute multi-step graph logic when static benchmarks become contaminated?How can tool-dependent scientific benchmark items be validated as executable, nontrivial, and solvable?
Home
Topics
Search
Library