Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on SDP
Nathan Benedetto Proen\c{c}a, Marcel K. de Carli Silva, Gabriel, Coutinho

TL;DR
This paper introduces dual Hoffman bounds derived from SDP norms that connect the stability and chromatic numbers of graphs, unifying and strengthening existing bounds through duality and convex optimization techniques.
Contribution
It presents a new family of norms providing dual bounds for stability and chromatic numbers, linking Hoffman's and Lovász theta bounds via duality and strengthening previous convex bounds.
Findings
New norms achieve Lovász theta function at their optimum.
Hoffman's bound and Delsarte-Hoffman ratio bound are formally dual.
Weighted bounds relate stability and fractional chromatic numbers.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research
