Lovász Theta Number
A graph-theoretic quantity introduced by László Lovász in 1979, computable exactly in polynomial time via semidefinite programming. It satisfies a sandwich relationship between the independence number, clique number, and chromatic number, and serves as a key bridge connecting discrete graph-theoretic properties with continuous spectral geometry.
Timeline (last 90 days)
The semidefinite program used by SSLD to find the first color class is similar to the semidefinite program used to compute the Lovász theta number.
The Lovász theta number was introduced by László Lovász in 1979 and satisfies sandwiching relations such as α(G) ≤ ϑ(Ḡ) and ω(G) ≤ ϑ(G) ≤ χ(G), and can be computed exactly in polynomial time via SDP.
All Facts (2)
The semidefinite program used by SSLD to find the first color class is similar to the semidefinite program used to compute the Lovász theta number.
50%UnverifiedThe Lovász theta number was introduced by László Lovász in 1979 and satisfies sandwiching relations such as α(G) ≤ ϑ(Ḡ) and ω(G) ≤ ϑ(G) ≤ χ(G), and can be computed exactly in polynomial time via SDP.
50%