ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M=(V,E∪A)M=(V,E\cup A) be a mixed graph, with directed arcs AA and undirected edges EE. For U⊂VU\subset V, a pseudo dicut is δE(U)\delta_E(U) when no directed arc enters UU. Its minimum pseudo dicut size is the smallest cardinality of a pseudo dicut.

Mixed-graph threshold orientation conjecture. There is a constant k>2k>2 such that every mixed graph with minimum pseudo dicut size at least kk has an orientation E+E^+ satisfying

∣δE++(U)∣,∣δE+−(U)∣≥1|\delta_{E^+}^+(U)|,|\delta_{E^+}^-(U)|\geq 1

for every pseudo dicut δE(U)\delta_E(U).

This is presented as a weaker question than the preceding mixed-graph orientation conjecture; the source gives no resolution.

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.