activity
20242026
most citedSelected Open Problems in Continuous-Time Quantum Walks

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2025

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…