arXiv:1903.05495 Abstract | arXiv Analytics

Published 2019-03-13Version 1

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

Categories: math.CO, cs.DM

Keywords: extremal combinatorics, refuting conjectures, apply simple linear programming methods, lp solver, open conjectures

Related articles: Most relevant | Search more

arXiv:1910.05966 [math.CO] (Published 2019-10-14)

Graphical Designs and Extremal Combinatorics

arXiv:2504.16265 [math.CO] (Published 2025-04-22, updated 2025-05-16)

Term Coding for Extremal Combinatorics: Dispersion and Complexity Dichotomies

Søren Riis

arXiv:2009.12692 [math.CO] (Published 2020-09-26)

Problems and results in Extremal Combinatorics -- IV

Noga Alon