Family-size stabilization conjecture for complete multipartite graphs
Statement
Let , let , and define
If and , then the family-size stabilization conjecture asserts that
Here is the complete multipartite graph with part sizes , denotes the number of edges of , and denotes the family of graphs obtainable from by sequences of Triangle-Y and Y-Triangle moves. The conjecture predicts a precise one-unit difference between the family sizes at the indicated parameters, extending the pattern observed in the tables and the proved stabilization result for the related family-size function. The general assertion remains 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.