Edge bound conjecture for minimally cal R_d-connected graphs
Statement
Let be a minimally -connected graph, meaning that is not -connected for every edge . The graph denotes the complete graph on vertices.
Edge-bound conjecture. One has
with equality if and only if .
The cases were settled in the cited work of Jear, while the general-dimensional assertion is the subject of the conjecture.
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.