Refuting conjectures in extremal combinatorics via linear programming
From MaRDI portal
Publication:2010628
DOI10.1016/J.JCTA.2019.105130zbMATH Open1428.05308arXiv1903.05495OpenAlexW2971878587WikidataQ123246970 ScholiaQ123246970MaRDI QIDQ2010628FDOQ2010628
Publication date: 27 November 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.
Full work available at URL: https://arxiv.org/abs/1903.05495
Recommendations
- A combinatorial bound for linear programming and related problems
- On combinatorial properties of linear program digraphs
- On a bound in extremal combinatorics
- A linear programming approach to the Manickam-Miklós-Singhi conjecture
- Expressing combinatorial optimization problems by linear programs
- scientific article; zbMATH DE number 1072400
- scientific article; zbMATH DE number 203962
- Further asymptotic size Ramsey results obtained via linear programming
- scientific article
- Linear programming in some Ramsey problems
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Title not available (Why is that?)
- An Erdös-Ko-Rado theorem for direct products
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Title not available (Why is that?)
- On a combinatorial conjecture of Erdös
- A survey of forbidden configuration results
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- A cross-intersection theorem for vector spaces based on semidefinite programming
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
- Families with no s pairwise disjoint sets
- A semidefinite programming approach to a cross-intersection problem with measures
- Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- Extremal Problems for Finite Sets
- Families of sets with no matchings of sizes 3 and 4
- Antichains of fixed diameter
- A degree version of the Hilton-Milner theorem
- A general 2-part Erdȍs-Ko-Rado theorem
Cited In (6)
- A combinatorial bound for linear programming and related problems
- Turán number of disjoint triangles in 4-partite graphs
- A generalization of diversity for intersecting families
- Short proofs of three results about intersecting systems
- On families with bounded matching number
- The maximum measure of non-trivial 3-wise intersecting families
This page was built for publication: Refuting conjectures in extremal combinatorics via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010628)
