A characterization of Delsarte's linear programming bound as a ratio bound
DOI10.1016/J.LAA.2006.10.009zbMATH Open1113.05102OpenAlexW2003572255WikidataQ114851468 ScholiaQ114851468MaRDI QIDQ876308FDOQ876308
Authors: 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
Recommendations
- A subexponential bound for linear programming
- On the optimum of Delsarte's linear program
- A combinatorial bound for linear programming and related problems
- Rigorous Lower and Upper Bounds in Linear Programming
- Bounding duality gap for separable problems with linear constraints
- Boundedness relations in linear semi-infinite programming
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Linear programming bounds
- Bounds for the solution set of linear complementarity problems
- A review of computation of mathematically rigorous bounds on optima of linear programs
quadratic programmingcombinatorial optimizationgraph theoryassociation schememaximum stable setDelsarte's linear programming bound
Quadratic programming (90C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear programming (90C05) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Association schemes, strongly regular graphs (05E30)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- On the Shannon capacity of a graph
- The ellipsoid method and its consequences in combinatorial optimization
- Approximation of the stability number of a graph via copositive programming
- Title not available (Why is that?)
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A comparison of the Delsarte and Lovász bounds
- A note on the stability number of an orthogonality graph
- Graphs with least eigenvalue \(-2\) attaining a convex quadratic upper bound for the stability number
- An upper bound on the independence number of a graph computable in polynomial-time
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- A comparison of the Delsarte and Lovász bounds
- Hoffman's ratio bound
- An Erdős-Ko-Rado theorem for finite classical polar spaces
- Optimal and extremal graphical designs on regular graphs associated with classical parameters
- Linear programming bounds for regular graphs
- A note on the stability number of an orthogonality graph
- A note on Erdős-Ko-Rado sets of generators in Hermitian polar spaces
- Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
This page was built for publication: A characterization of Delsarte's linear programming bound as a ratio bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876308)
