Refuting conjectures in extremal combinatorics via linear programming
arXiv:1903.05495
Abstract
We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.
arXiv:1903.05495
We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.