Refuting conjectures in extremal combinatorics via linear programming

Published 13 Mar 2019 in math.CO and cs.DM | (1903.05495v1)

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

Authors (1)

Citations (14)

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.