ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bridgeless graph with mm edges, and let the length of a cycle cover be the sum of the lengths of all cycles in the cover. Short Cycle Cover Conjecture. Every bridgeless graph with mm edges has a cycle cover of length at most 1.4m1.4m.

This conjecture, attributed in the paper to Alon and Tarsi, concerns quantitative bounds on the shortest cycle cover. The paper proves upper bounds for bridgeless cubic graphs, but does not resolve the stated bound for all bridgeless graphs.

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.