Refuting conjectures in extremal combinatorics via linear programming

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:169

Article

Wagner, Adam Zsolt¹ 

[1] ETH, Dept Math, Zurich, Switzerland

关键词: Linear programing;    Boolean lattice;    Counterexamples;   

DOI  :  10.1016/j.jcta.2019.105130

来源: Elsevier

【 摘 要 】

We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics. (C) 2019 Elsevier Inc. All rights reserved.

【 授权许可】

Free