Katona–Varga's generalized Kriesell conjecture
Statement
Let , and let a minimally -tough graph be a -tough graph whose toughness decreases after deleting any edge. Katona–Varga's generalized conjecture. Every minimally -tough graph has a vertex of degree . The conjecture was disproved: Zheng and Sun (2024) found counterexamples for real close enough to , and Cheng, Li, and Liu (2024) later gave new families of -regular and -regular counterexamples.
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.