Minimum semidefinite rank conjecture for graphs of large girth
Statement
Let be a connected graph on vertices, and let be an integer. The minimum semidefinite rank is the smallest rank among all positive semidefinite Hermitian matrices with graph . The girth of is the length of its shortest cycle.
Large-girth minimum semidefinite rank conjecture. If has girth at least , then
This conjecture seeks to generalize the known lower bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.