ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let ψ\psi be an activity. The activity ψ\psi is strongly Tutte-descriptive if it is Tutte-descriptive and induces a partition

2E(G)=⨄T spanning tree of G[T\ψ(T),T∪ψ(T)].2^{E(G)}=\biguplus_{T\text{ spanning tree of }G}[T\backslash \psi(T),T\cup \psi(T)].

Characterization of strongly Tutte-descriptive activities. For any graph GG, an activity ψ\psi is strongly Tutte-descriptive if and only if there exists a decision tree Δ\Delta such that ψ\psi equals the Δ\Delta-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 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.