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 star product is the cubic graph operation that deletes one degree-3 vertex from each factor and joins the three resulting pairs of neighbours. Let GG be a 3-edge-connected cubic bipartite graph.

Abreu–Diwan–Jackson–Labbate–Schwenk's conjecture. GG is pseudo 2-factor isomorphic if and only if GG can be obtained from K3,3K_{3,3}, the Heawood graph or the Pappus graph by repeated star products.

This conjecture gives a proposed classification of all 3-edge-connected cubic bipartite graphs with the parity property. The supplied text gives no resolution of this statement.

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.