Linear programming bounds for cliques in Paley graphs

by   Mark Magsino, et al.
The Ohio State University

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 maximal clique, and so one can instead apply this semidefinite programming bound to the local graph. In the case of the Paley graph, the local graph is circulant, and so this bound reduces to a linear programming bound, allowing for fast computations. Impressively, the value of this program with Schrijver's nonnegativity constraint rivals the state-of-the-art closed-form bound recently proved by Hanson and Petridis. We conjecture that this linear programming bound improves on the Hanson-Petridis bound infinitely often, and we derive the dual program to facilitate proving this conjecture.


page 1

page 2

page 3

page 4


Integrality Gap of the Vertex Cover Linear Programming Relaxation

We give a characterization result for the integrality gap of the natural...

Semidefinite Programming in Timetabling and Mutual-Exclusion Scheduling

In scheduling and timetabling applications, the mutual-exclusion constra...

Revisiting the Graph Isomorphism Problem with Semidefinite Programming

We present a new algorithm for the graph isomorphism problem which solve...

Packing functions and graphs with perfect closed neighbourhood matrices

In this work we consider a straightforward linear programming formulatio...

Lower bound for the cost of connecting tree with given vertex degree sequence

The optimal connecting network problem generalizes many models of struct...

Bayesian Inference of Random Dot Product Graphs via Conic Programming

We present a convex cone program to infer the latent probability matrix ...

Strong SDP based bounds on the cutwidth of a graph

Given a linear ordering of the vertices of a graph, the cutwidth of a ve...

Please sign up or login with your details

Forgot password? Click here to reset