Hušek–Šámal's exponential circuit double cover conjecture
Statement
Let be a -connected cubic graph on vertices. A circuit double cover (CiDC) is a finite family of connected -regular subgraphs of such that every edge belongs to exactly two members of the family.
Hušek–Šámal's conjecture. The graph has at least
CiDCs.
This is a quantitative strengthening of the cycle double cover problem. The bound is proved in the source for -connected -edge-colorable cubic graphs and is known to be tight for Klee graphs, while the general conjecture remains open.
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.