The tightness conjecture for diffusion games
Statement
Let be a finite graph with an initial chip configuration. Call tight if the resulting diffusion-game process is eventually fixed or periodic with period length .
Tightness conjecture. Every finite graph and initial configuration is tight.
The conjecture strengthens the question of whether every diffusion-game process is eventually periodic. It is known for paths, cycles, wheels, stars, complete graphs, and complete bipartite graphs, but remains open for general 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.