Abstract: We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback