ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. A cubic graph is essentially 4-edge-connected if it has no non-trivial 3-edge-cuts. Let GG be an essentially 4-edge-connected pseudo 2-factor isomorphic cubic bipartite graph.

Abreu–Diwan–Jackson–Labbate–Schwenk's conjecture. GG must be K3,3K_{3,3}, the Heawood graph or the Pappus graph.

The conjecture is the essentially 4-edge-connected case of the broader classification conjecture. It was refuted by a computer-search counterexample constructed by Goedgebeur, and consequently the broader conjecture was refuted as well.

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.