ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let E(G)E(G) denote its edge set. A 3-flow on GG is a flow whose values lie in a group of order three, and its support is the set of edges on which the flow is nonzero. Large-support 3-flow conjecture. Every 2-edge-connected graph GG has a 3-flow ϕ\phi satisfying

∣supp⁡(ϕ)∣≥56∣E(G)∣.|\operatorname{supp}(\phi)| \ge \tfrac{5}{6}|E(G)|.

The paper presents this as a proposed extension of its methods beyond 3-edge-connected graphs; its status is not resolved in the supplied text.

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.