ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple 33-connected graph with ∣E(G)∣≥13|E(G)| \ge 13.

Detachable-pair classification conjecture. Either GG has a pair of edges {x,y}\{x,y\} such that either G\x\yG\backslash x\backslash y or G/x/yG/x/y is a simple 33-connected graph; GG is a wheel; G≅K3,kG \cong K_{3,k} for some k≥5k \ge 5; GG is a twisted wheel; or GG 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 33-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 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.