ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite graph without loops, possibly with multiple edges. A graph is Z3\mathbb{Z}_3-connected if, for every zero-sum function β:V(G)→Z3\beta:V(G)\to\mathbb{Z}_3, there is an orientation DD such that

dD+(v)−dD−(v)=β(v)(mod3)d_D^+(v)-d_D^-(v)=\beta(v)\pmod 3

for every vertex v∈V(G)v\in V(G). Jaeger, Linial, Payan and Tarsi's conjecture. Every 55-edge-connected graph is Z3\mathbb{Z}_3-connected. This generalizes the relationship between nowhere-zero flows and modulo orientations; it remains open, while every 66-edge-connected graph is known to be Z3\mathbb{Z}_3-connected.

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.