Katona–Varga's generalized Kriesell conjecture
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 .
References
2 papers in this index state this conjecture (2024–2025). The statement above is taken from the most recent of them; the others are arXiv:2412.12659.
Status
- Refuted: Wei Zheng and Lei Sun. Disproof of a conjecture on minimally t-tough graphs (Discrete Mathematics, 2024) https://www.sciencedirect.com/science/article/abs/pii/S0012365X24001134
Source: Morteza Hasanvand, “On the existence of minimally tough graphs having large minimum degrees”, arXiv:2505.08131 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.