ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite undirected graph. An orientation of GG is obtained by directing each edge, and GG is strongly consistent if every orientation of GG is consistent, where consistency means that the minimum number of directed paths in an edge decomposition equals the excess

ex⁡(D)=12∑v∈V(D)∣d+(v)−d−(v)∣.\operatorname{ex}(D)=\frac{1}{2}\sum_{v\in V(D)}\lvert d^+(v)-d^-(v)\rvert.

Pullman's conjecture. For odd dd, every dd-regular graph is strongly consistent. This generalizes the even-order tournament conjecture from complete graphs to all odd-regular graphs; the paper develops results for sparse graphs but does not resolve the conjecture in full.

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.