A semidefinite programming approach to a cross-intersection problem with measures

DOI10.1007/S10107-016-1106-3zbMath1375.05261arXiv1504.00135OpenAlexW3106424336MaRDI QIDQ1683683

Norihide Tokushige, Hajime Tanaka, Sho Suda

Publication date: 1 December 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00135

zbMATH Keywords

semidefinite programmingErdős-Ko-Rado theoremmeasureintersection theoremcross-intersecting families

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Semidefinite programming (90C22) Combinatorial optimization (90C27) Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Application of hypergraph Hoffman's bound to intersecting families ⋮ The maximum measure of non-trivial 3-wise intersecting families ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ When are stars the largest cross-intersecting families? ⋮ Invitation to intersection problems for finite sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalue method for cross \(t\)-intersecting families
• The exact bound in the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• On the measure of intersecting families, uniqueness and stability
• On cross \(t\)-intersecting families of sets
• Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado
• Erdös–Ko–Rado Theorem—22 Years Later
• Approximation Algorithms and Semidefinite Programming
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Semidefinite optimization
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Probabilities for Intersecting Systems and Random Subsets of Finite Sets
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• Weighted multiply intersecting families
• A cross-intersection theorem for vector spaces based on semidefinite programming
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: A semidefinite programming approach to a cross-intersection problem with measures