The weighted expanding formulation of Seymour's conjecture
Statement
Let be a digraph without loops or two-cycles. Give each vertex a nonnegative real weight, and call a vertex weakly expanding when the weight of its second out-neighborhood is at least the weight of its first out-neighborhood. Weighted expanding formulation of Seymour's conjecture. Every digraph without loops or two-cycles has a vertex-weighting such that every vertex is weakly expanding. By the preceding argument, this formulation is equivalent to Seymour's second neighborhood conjecture. The paper uses it to relate the conjecture to an alternative involving strongly contracting vertices in the reverse digraph; it does not resolve the general case.
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.