ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph's metamour period is the least positive integer kk for which its iterated metamour graph returns to the original graph, under the metamour operation used in the paper. Let kk range over the positive odd integers.

Finiteness conjecture. For each odd k∈Z+k\in \mathbb{Z}^+, there exist only finitely many connected graphs with metamour period kk.

The paper has already classified the connected graphs with metamour period 33: they are C7C_7 and C9C_9. The conjecture predicts analogous finiteness for every odd period, and the classification of such graphs remains open in general.

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.