ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the path graph on nn vertices, and let CnC_n be the cycle graph on nn vertices. The incompatibility robustness of a graph is denoted by η(⋅)\eta(\cdot).

Path-graph robustness conjecture. For all n≥1n\geq 1,

η(P2n)=η(P2n+1)=η(C2n+2)=22n+2csc⁡(π2n+2).\eta(P_{2n})=\eta(P_{2n+1})=\eta(C_{2n+2})=\frac{2}{2n+2}\csc\Big(\frac{\pi}{2n+2}\Big).

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 n≥1n\geq 1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.