The conjecture on exactly six exceptional autonomous components
Statement
Let a Goldbach factorization graph be a graph associated with an even integer and let an exceptional autonomous component (EAC) denote the special source strongly connected component studied in the paper. The conjecture on exactly six exceptional autonomous components. There exist exactly six exceptional autonomous components of Goldbach factorization graphs. The paper reports six EACs in the checked range , but explicitly leaves the finiteness of the full set undetermined; the asserted global count is therefore open.
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.