Polynomial Length Cycles In Tough Graphs

@misc{segal2026polynomial,
  title = {{Polynomial Length Cycles In Tough Graphs}},
  author = {Levi Segal and Jacques Verstraete},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.16398},
  eprint = {2609.16398},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.16398},
}

TY  - UNPB
TI  - Polynomial Length Cycles In Tough Graphs
AU  - Levi Segal
AU  - Jacques Verstraete
PY  - 2026
DA  - 2026/09/14
PB  - arXiv
DO  - 10.48550/arxiv.2609.16398
UR  - https://arxiv.org/abs/2609.16398
AB  - We prove that every n-vertex $15$-tough graph contains a cycle of length Ω(n^1/20).
ER  -