ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥3n \geq 3, let 1≤a1≤⋯≤an1 \leq a_1 \leq \cdots \leq a_n, and define

e=#E(Ka1,…,an−1).e = \#E(K_{a_1, \ldots, a_{n-1}}).

If a1+⋯+an−1>6a_1 + \cdots + a_{n-1} > 6 and an≥ea_n \geq e, then the family-size stabilization conjecture asserts that

∣F(Ka1,…,an−1,e−1)∣=∣F(Ka1,…,an−1,an)∣−1.\left|\mathcal{F}(K_{a_1, \ldots, a_{n-1}, e-1})\right| = \left|\mathcal{F}(K_{a_1, \ldots, a_{n-1}, a_n})\right| - 1.

Here Ka1,…,anK_{a_1,\ldots,a_n} is the complete multipartite graph with part sizes a1,…,ana_1,\ldots,a_n, #E(G)\#E(G) denotes the number of edges of GG, and F(G)\mathcal{F}(G) denotes the family of graphs obtainable from GG 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 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.