ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The paper considers a rooted digraph DD with root rr, and for each vertex v∈V(D)−rv\in V(D)-r the cardinality κD(r,v)\kappa_D(r,v) measures the maximum size of a family of pairwise vertex-disjoint directed paths from rr to vv. Theorem asserts the relevant vertex-flame conclusion under the assumption that DD is countable.

Countability-free vertex-flame conjecture. We may omit the countability of DD in Theorem.

The preceding discussion notes that the countability assumption can already be weakened to the condition κD(r,v)≤ℵ0\kappa_D(r,v)\leq\aleph_0 for every v∈V−rv\in V-r, using Davies-trees. The conjecture asks whether the theorem remains valid without any countability assumption.

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.