Journal of Combinatorial Theory, Series AVolume 169, January 2020, 105130Refuting conjectures in extremal combinatorics via linear programming☆Author links open overlay panelAdam Zsolt WagnerShow moreShareCitehttps://doi.org/10.1016/j.jcta.2019.105130Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.Previous article in issueNext article in issueKeywordsLinear programingBoolean latticeCounterexamplesRecommended articlesCited by (0)☆This is a shortened version of the original tutorial-style paper, which can be found on arXiv [24].© 2019 Elsevier Inc.
