Refuting conjectures in extremal combinatorics via linear programming
From MaRDI portal
(Redirected from Publication:2010628)
Abstract: We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.
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; zbMATH DE number 69364
- Linear programming in some Ramsey problems
Cites work
- A cross-intersection theorem for vector spaces based on semidefinite programming
- A degree version of the Hilton-Milner theorem
- A general 2-part Erdős-Ko-Rado theorem
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- A semidefinite programming approach to a cross-intersection problem with measures
- A survey of forbidden configuration results
- An Erdös-Ko-Rado theorem for direct products
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Antichains of fixed diameter
- Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
- Extremal problems for finite sets
- Families of sets with no matchings of sizes 3 and 4
- Families with no s pairwise disjoint sets
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- On a combinatorial conjecture of Erdös
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Turán numbers of vertex-disjoint cliques in r-partite graphs
Cited in
(7)- Turán number of disjoint triangles in 4-partite graphs
- A combinatorial bound for linear programming and related problems
- On families with bounded matching number
- The maximum measure of non-trivial 3-wise intersecting families
- A generalization of diversity for intersecting families
- Short proofs of three results about intersecting systems
- New Ramsey multiplicity bounds and search heuristics
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)
