ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bridgeless graph with mm edges. A cycle cover of GG is a multiset of cycles from GG such that every edge of GG belongs to at least one cycle, and its length is the sum of the lengths of its cycles.

Short cycle cover conjecture. Every bridgeless graph with mm edges has a cycle cover of length at most 1.4m1.4m.

This conjecture was independently proposed by Alon and Tarsi and by Jaeger. The paper proves weaker bounds for bridgeless cubic graphs, so the stated 1.4m1.4m bound remains unresolved here.

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.