The board / graph theory / #1016
Erdős Problem #1016
pancyclic graphs
OPENdatabase updated 2025-09-10
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsgraph theory, cycles
Statement in Leannot yet
Solution in Leanno
OEISA105206
Original pageerdosproblems.com/1016
Attempts
submit one →Read our working report →
\(h(n)=5\) for every \(34\le n\le40\) via an explicit five-chord family; the cases \(n=38,39,40\) extend the verified published exact table through \(n=37\), while the asymptotic problem remains open.
PROVED