Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming
From MaRDI portal
Publication:5013579
Abstract: The notion of duality is a key element in understanding the interplay between the stability and chromatic numbers of a graph. This notion is a central aspect in the celebrated theory of perfect graphs, and is further and deeply developed in the context of the Lov'asz theta function and its equivalent characterizations and variants. The main achievement of this paper is the introduction of a new family of norms, providing upper bounds for the stability number, that are obtained from duality from the norms motivated by Hoffman's lower bound for the chromatic number and which achieve the (complementary) Lov'asz theta function at their optimum. As a consequence, our norms make it formal that Hoffman's bound for the chromatic number and the Delsarte-Hoffman ratio bound for the stability number are indeed dual. Further, we show that our new bounds strengthen the convex quadratic bounds for the stability number studied by Luz and Schrijver, and which achieve the Lov'asz theta function at their optimum. One of the key observations regarding weighted versions of these bounds is that, for any upper bound for the stability number of a graph which is a positive definite monotone gauge function, its gauge dual is a lower bound on the fractional chromatic number, and conversely. Our presentation is elementary and accessible to a wide audience.
Recommendations
- Copositive programming motivated bounds on the stability and the chromatic numbers
- A lower bound for the chromatic number of a graph
- More tales of Hoffman: bounds for the vector chromatic number of a graph
- Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number
- Bounds on the stability number of a graph via the inverse theta function
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 204193 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- A Convex Quadratic Characterization of the Lovász Theta Number
- A characterization of the weighted Lovász number based on convex quadratic programming
- A comparison of the Delsarte and Lovász bounds
- A quadratic programming approach to the determination of an upper bound on the weighted stability number
- An axiomatic duality framework for the theta body and related convex corners
- An inertial lower bound for the chromatic number of a graph
- An upper bound on the independence number of a graph computable in polynomial-time
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Conic formulations of graph homomorphisms
- Eigenvalue bounds for independent sets
- Foundations of gauge and perspective duality
- Gauge optimization and duality
- Generalized inverses. Theory and applications.
- Geometric algorithms and combinatorial optimization.
- Infinite dimensional analysis. A hitchhiker's guide.
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- On the Shannon capacity of a graph
- Relaxations of vertex packing
- Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number
- The Operator $\Psi$ for the Chromatic Number of a Graph
- The sandwich theorem
This page was built for publication: Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013579)
