Indexed metadata
Polynomial Length Cycles In Tough Graphs
Levi Segal, Jacques Verstraete
Source abstract
We prove that every -vertex -tough graph contains a cycle of length .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.