Orbit length conjecture for iterated bridge sums of trees and complete graphs
Statement
Let be graphs on vertices, respectively, where each is either a complete graph or a tree. Form by bridge summing with , with , and so on, at arbitrary vertices. Let and let . Iterated bridge-sum orbit-length conjecture. For all such , the orbit length of toric promotion on is . This is known when all the summands are trees, but remains open for arbitrary mixtures of trees and complete graphs.
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.