Treewidth order conjecture for token graphs of trees
Statement
Let ) be a tree on vertices, and let denote its -token graph, whose vertices are the -subsets of . For a fixed integer satisfying , the treewidth order conjecture for token graphs of trees.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.