ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a cubic graph be a graph in which every vertex has valence three, and let its complexity be the number of spanning trees. A cubic graph has maximal complexity if its complexity is maximal among cubic graphs of the same order.

3-connectivity conjecture. A cubic graph with maximal complexity is 33-connected.

This is generally believed, including for broader classes of graphs, but no proof is known. The conjecture holds for genus at most 88; 33-connected graph curves also have geometrical significance because their canonical bundle is very ample.

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.