Mixed-graph pseudo-dicut orientation threshold conjecture
Statement
Let be a mixed graph, with directed arcs and undirected edges . For , a pseudo dicut is when no directed arc enters . Its minimum pseudo dicut size is the smallest cardinality of a pseudo dicut.
Mixed-graph threshold orientation conjecture. There is a constant such that every mixed graph with minimum pseudo dicut size at least has an orientation satisfying
for every pseudo dicut .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.