ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG) be a tree on nn vertices, and let Fk(G)F_k(G) denote its kk-token graph, whose vertices are the kk-subsets of V(G)V(G). For a fixed integer kk satisfying 1≤k≤n−11\le k\le n-1, the treewidth order conjecture for token graphs of trees.

tw⁡(Fk(G))∈Θ(nk−1).\operatorname{tw}(F_k(G)) \in \Theta(n^{k-1}).

This extends the established order of growth for token graphs of stars and paths to all trees. The conjecture is presented as open 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.