ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A pseudo 22-factor isomorphic graph is a graph admitting a 22-factor such that the parity of the number of cycles is the same for all its 22-factors. A graph is cubic if every vertex has degree 33, and it is essentially 44-edge-connected if it has no non-trivial 33-edge-cut. Let GG be an essentially 44-edge-connected pseudo 22-factor isomorphic cubic bipartite graph. The classification conjecture. GG must be K3,3K_{3,3}, the Heawood graph, or the Pappus graph. This conjecture was refuted when Jan Goedgebeur computationally found a pseudo 22-factor isomorphic cubic bipartite graph on 3030 vertices that is essentially 44-edge-connected and cyclically 66-edge-connected.

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.