Li's conjecture on the complexity of deciding k-connectivity
Statement
Let be fixed, let be a graph, and let be an integer. Li's conjecture. Deciding whether is -complete. The source states this conjecture after noting that the corresponding problem for fixed is known and that the case was confirmed; it does not explicitly state a resolution for every fixed .
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.