Finiteness conjecture for connected graphs with odd metamour period
Statement
A graph's metamour period is the least positive integer for which its iterated metamour graph returns to the original graph, under the metamour operation used in the paper. Let range over the positive odd integers.
Finiteness conjecture. For each odd , there exist only finitely many connected graphs with metamour period .
The paper has already classified the connected graphs with metamour period : they are and . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.