Year: 2026
Type: preprint
Abstract: We prove that every $n$-vertex $15$-tough graph contains a cycle of length $Ω(n^{1/20})$.
Source: arXiv (Cornell University)
Authors: Segal, Levi, Verstraete, Jacques
Institution: University of California San Diego
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7213407620