The detachable-pair classification conjecture for simple 3-connected graphs
Statement
Let be a simple -connected graph with .
Detachable-pair classification conjecture. Either has a pair of edges such that either or is a simple -connected graph; is a wheel; for some ; is a twisted wheel; or is an unhinged multi-dimensional wheel.
This is the graphic interpretation of the preceding matroid conjecture and concerns the existence of pairs of edges whose deletion or contraction preserves simplicity and -connectivity. The listed graph families are the exceptional possibilities; the conjecture is open in the supplied text.
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.