Linear programming bounds for cliques in Paley graphs

Mark Magsino, Dustin G. Mixon, Hans Parshall

The Lovász theta number is a semidefinite programming bound on the clique number of (the complement of) a given graph. Given a vertex-transitive graph, every vertex belongs to a ma…