LP obstructions and cyclic blow-ups for DeVos's distribution conjecture
Statement
Conjecture 6. 2 8. (Devos) For any digraph G with no directed cycles of length at most three, there is a probability distribution p on V (G) such that at every vertex v, p(N +(v)) ≥ p(N −(v))
and p(N −
2
(v)) ≥ p(N −(v)), where p(S):= ∑
s∈S
p(s) for a set S ⊆ V (G).Notes: For tournaments, such a distribution exists, and is unique. Its existence for a general digraph would imply Seymour's Second Neighborhood Conjecture, and actually it would suffice to just have a probability distribution p so that p(N −
2
(v)) ≥ p(N −(v)) on average in G.Given a digraph G = ( V, E ), we say F ⊆ E(G) is a feedback arc set if the digraph G′ = ( V, E −F )has no directed cycles.
Record
- Source
- Added
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.