Path-graph incompatibility robustness conjecture
Statement
Let be the path graph on vertices, and let be the cycle graph on vertices. The incompatibility robustness of a graph is denoted by .
Path-graph robustness conjecture. For all ,
The prediction is motivated by comparisons with exact values obtained by semidefinite programming and by the asymptotically tight bounds previously established for paths. It remains open whether these equalities hold for every .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.