Generalized Kriesell's conjecture for minimally tough graphs
Statement
Let be a real number, and let be a graph. A graph is minimally -tough when and for every edge , where denotes its toughness. It is Generalized Kriesell's conjecture that every minimally -tough graph has a vertex of degree . This naturally generalizes Kriesell's conjecture for , and the paper reports that the associated Kriesell conjecture was recently disproved.
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.