ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let BnB_n be the type-BnB_n case, and consider the equation referred to in the source as Equation. Starting from the simple graphs and applying the construction described immediately before the conjecture, one obtains π(n)\pi(n) graphs, where π(n)\pi(n) denotes the number of partitions of nn.

Alev's completeness conjecture. For every integer n≥2n\geq 2, these π(n)\pi(n) constructed graphs are the only solutions of the equation.

The claim would classify all solutions in the BnB_n case by the preceding graph construction. No general proof or disproof is supplied 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.