Countability-free vertex-flame conjecture
Statement
The paper considers a rooted digraph with root , and for each vertex the cardinality measures the maximum size of a family of pairwise vertex-disjoint directed paths from to . Theorem asserts the relevant vertex-flame conclusion under the assumption that is countable.
Countability-free vertex-flame conjecture. We may omit the countability of in Theorem.
The preceding discussion notes that the countability assumption can already be weakened to the condition for every , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.