Refuting conjectures in extremal combinatorics via linear programming
From MaRDI portal
Publication:2010628
DOI10.1016/j.jcta.2019.105130zbMath1428.05308arXiv1903.05495OpenAlexW2971878587WikidataQ123246970 ScholiaQ123246970MaRDI QIDQ2010628
Publication date: 27 November 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.05495
Related Items
Turán number of disjoint triangles in 4-partite graphs, On families with bounded matching number, The maximum measure of non-trivial 3-wise intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Families of sets with no matchings of sizes 3 and 4
- A semidefinite programming approach to a cross-intersection problem with measures
- Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
- A degree version of the Hilton-Milner theorem
- A survey of forbidden configuration results
- An Erdös-Ko-Rado theorem for direct products
- Antichains of fixed diameter
- Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extremal Problems for Finite Sets
- A general 2-part Erdȍs-Ko-Rado theorem
- Families with no s pairwise disjoint sets
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- A cross-intersection theorem for vector spaces based on semidefinite programming
- On a combinatorial conjecture of Erdös
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
