Refuting conjectures in extremal combinatorics via linear programming
Abstract
We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.