ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph on n≥2n\geq 2 vertices, and let k≥4k\geq 4 be an integer. The minimum semidefinite rank msr(G){\rm msr}(G) is the smallest rank among all positive semidefinite Hermitian matrices with graph GG. The girth of GG is the length of its shortest cycle.

Large-girth minimum semidefinite rank conjecture. If GG has girth at least kk, then

msr(G)≥(k−2k)n.{\rm msr}(G)\geq \left(\frac{k-2}{k}\right)n.

This conjecture seeks to generalize the known lower bound msr(G)≥n/2{\rm msr}(G)\geq n/2 for connected triangle-free graphs, viewing triangle-freeness as a girth lower bound. Its status is not determined by the supplied source information.

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.