The girth-five frustration index conjecture for signed subcubic graphs
Statement
Let be a signed connected simple subcubic graph, where denotes the number of vertices of , denotes its frustration index, and the girth is the length of its shortest cycle. Girth-five frustration index conjecture. If has girth at least , then
This proposes an improved upper bound for the frustration index when short cycles are forbidden; its status is open in the supplied source.
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.