ProbXiv
Explorersign in
Problem archiveProblem record

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 33-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.