A characterization of Delsarte's linear programming bound as a ratio bound

DOI10.1016/j.laa.2006.10.009zbMath1113.05102OpenAlexW2003572255WikidataQ114851468 ScholiaQ114851468MaRDI QIDQ876308

Carlos J. Luz

Publication date: 18 April 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.10.009

zbMATH Keywords

quadratic programmingassociation schemecombinatorial optimizationgraph theorymaximum stable setDelsarte's linear programming bound

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Association schemes, strongly regular graphs (05E30) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A note on Erdős-Ko-Rado sets of generators in Hermitian polar spaces ⋮ Optimal and extremal graphical designs on regular graphs associated with classical parameters ⋮ Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces ⋮ An Erdős-Ko-Rado theorem for finite classical polar spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• An upper bound on the independence number of a graph computable in polynomial-time
• A note on the stability number of an orthogonality graph
• Approximation of the Stability Number of a Graph via Copositive Programming
• Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
• Matrix Analysis
• A comparison of the Delsarte and Lovász bounds
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Shannon capacity of a graph
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: A characterization of Delsarte's linear programming bound as a ratio bound