The classification conjecture for essentially 4-edge-connected pseudo 2-factor isomorphic cubic bipartite graphs
Statement
A pseudo -factor isomorphic graph is a graph admitting a -factor such that the parity of the number of cycles is the same for all its -factors. A graph is cubic if every vertex has degree , and it is essentially -edge-connected if it has no non-trivial -edge-cut. Let be an essentially -edge-connected pseudo -factor isomorphic cubic bipartite graph. The classification conjecture. must be , the Heawood graph, or the Pappus graph. This conjecture was refuted when Jan Goedgebeur computationally found a pseudo -factor isomorphic cubic bipartite graph on vertices that is essentially -edge-connected and cyclically -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.