ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.