Thomassen's chord conjecture for longest cycles in 3-connected graphs
Statement
A graph is 3-connected if deleting fewer than three vertices leaves it connected. A chord of a cycle is an edge joining two nonconsecutive vertices of the cycle. Thomassen's chord conjecture. Every longest cycle in a -connected graph has a chord. This conjecture is a major unsolved problem in graph theory, although it has been proved for cubic graphs and several other classes of graphs.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.