Answers are grounded in this paper and cite their sources.
This research demonstrates bounds on fractional cut-cover in graphs and spectral limits for maximum 2-SAT, highlighting their connections to eigenvalues.
We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue. We also extend the equality cases of a primal-dual inequality involving the Goemans-Williamson semidefinite program, which approximates {maxcut}, to graphs in certain coherent configurations. Moreover, we obtain spectral bounds for {max 2-sat} when the underlying graphs belong to a symmetric association scheme by means of a certain semidefinite program used to approximate quadratic programs, and we further develop this technique in order to explicitly compute the optimum value of its gauge dual in the case of distance-regular graphs.
No takes yet. Share an insight, caveat, or question.
Assumpção et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: