ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an Eulerian planar graph. An orientation is alternatingly in- and outward oriented at each vertex when, in the cyclic order around every vertex, its incident edges alternate between incoming and outgoing; equivalently, each facial cycle is oriented. Planar alternating-orientation conjecture. The orientation minimizing the number of arborescences is the alternatingly in- and outward oriented orientation at each vertex, namely the orientation in which the cycle around each face is oriented. The conjecture is motivated by the relation between directed short cycles and arborescence numbers. In the planar dual formulation, it says that the standard orientation of the associated bipartite dual corresponds to a facet of minimal volume of the symmetric edge polytope.

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.