Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs

Henrique Assumpção, Gabriel Coutinho

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 case…