Pullman's conjecture on strongly consistent odd-regular graphs
Statement
Let be a finite undirected graph. An orientation of is obtained by directing each edge, and is strongly consistent if every orientation of is consistent, where consistency means that the minimum number of directed paths in an edge decomposition equals the excess
Pullman's conjecture. For odd , every -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.