Refuting conjectures in extremal combinatorics via linear programming
type: Item
instance of: scholarly article
title: Refuting conjectures in extremal combinatorics via linear programming
zbMATH Open document ID: 1428.05308
author: Adam Zsolt Wagner
published in: Journal of Combinatorial Theory. Series A
publication date: 2019-11-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1903.05495
Mathematics Subject Classification ID: 05D99
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7137754
zbMATH Keywords: linear programing
zbMATH Keywords: Boolean lattice
zbMATH Keywords: counterexamples
MaRDI profile type: Publication
Wikidata QID: Q123246970
OpenAlex ID: W2971878587
arXiv ID: 1903.05495
cites work: A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
cites work: A survey of forbidden configuration results
cites work: Q4079613
cites work: Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
cites work: Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: An Erdös-Ko-Rado theorem for direct products
cites work: Antichains of fixed diameter
cites work: A degree version of the Hilton-Milner theorem
cites work: Families with no s pairwise disjoint sets
cites work: Families of sets with no matchings of sizes 3 and 4
cites work: Extremal Problems for Finite Sets
cites work: Q5538306
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: A general 2-part Erdȍs-Ko-Rado theorem
cites work: On a combinatorial conjecture of Erdös
cites work: Maximal number of subsets of a finite set No k of which are pairwise disjoint
cites work: A cross-intersection theorem for vector spaces based on semidefinite programming
cites work: A semidefinite programming approach to a cross-intersection problem with measures
cites work: An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
DOI: 10.1016/J.JCTA.2019.105130
Recommended article: A combinatorial bound for linear programming and related problems
Recommended article: Q3622252
Recommended article: On a bound in extremal combinatorics
Recommended article: A linear programming approach to the Manickam-Miklós-Singhi conjecture
Recommended article: Expressing combinatorial optimization problems by linear programs
Recommended article: Q4359293
Recommended article: Q4695280
Recommended article: Further asymptotic size Ramsey results obtained via linear programming
Recommended article: Q4014835
Recommended article: Linear programming in some Ramsey problems
description: scientific article