Characterization of strongly Tutte-descriptive activities
Statement
Let be a graph and let be an activity. The activity is strongly Tutte-descriptive if it is Tutte-descriptive and induces a partition
Characterization of strongly Tutte-descriptive activities. For any graph , an activity is strongly Tutte-descriptive if and only if there exists a decision tree such that equals the -activity.
The conjecture seeks to characterize precisely the activities arising from decision trees among those inducing the stated partition of the subgraphs. The right-to-left implication has already been proved in the paper through Theorem and Theorem; the converse is therefore the unresolved direction in the source.
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.