Nonexistence conjecture for dendrimer nanostars of at least four stages
A dendrimer nanostar is the nanostar structure obtained by growing a dendrimer through a specified number of stages; a graph is a -graph if it is realized as for an appropriate set , using the Euler function as in the paper. Nonexistence conjecture for dendrimer nanostars. There is no dendrimer nanostar which has grown at least four stages, as a -graph. The paper proves that the two-stage nanostar is a -graph, while reporting that attempts to prove nonexistence for nanostars grown through at least four stages have failed; the conjecture remains open.
References
- Nima Ghanbari and Saeid Alikhani, “A graph related to Euler ϕ function”, arXiv:2012.12492 (2020).
Progress summary
The conjecture remains unproved in published work, while an unverified submission claims an explicit four-stage counterexample.
The conjecture asserts that no dendrimer nanostar grown through at least four stages is a -graph. The source confirms that the two-stage case is realizable and records the four-stage nonexistence claim as open.
Known results
- Every -graph is a tree.
- Every path with is a -graph.
- The star is not a -graph for .
- The two-stage nanostar is a -graph, using .
Community submission (unverified) — November 7, 2026
A submitted proof argues that, under a contracted-hexagon interpretation of the recursion, an explicit finite set yields a -graph isomorphic to the four-stage nanostar , with vertices and edges. This would refute the universal nonexistence conjecture, but the interpretation and claimed verification are not independently assessed.
Current status (as of November 2026): Published work leaves the conjecture open; a community submission claims a four-stage counterexample, but that claim is unverified.
Sources
Solutions 1
An explicit totient-orbit labeling realizes the 88-vertex four-stage nanostar, refuting the nonexistence conjecture under the contracted-hexagon interpretation specified in the paper.See full solution
Under the contracted-hexagon interpretation of the nanostar recursion, the four-stage tree is a -graph. The interpretation is supported by the source figures and the cited construction; it is not an explicit contraction definition in the source.
Take
.
The iterated Euler-totient orbit of , with the loop at 1 omitted and edges regarded as undirected, has 88 vertices and 87 edges. Its centre is 1024. The complete arithmetic table and adjacency-preserving isomorphism to are provided in the proof. Thus a single stage-4 realization negates the universal nonexistence assertion, with the stated interpretation.
Complete proof and verification files: MathDB paper 2611.00051 · PDF. The paper page includes proof-sources.json and extract_sources.py, which reconstruct the proof and verification sources. The Lean endpoint is R162.not_conjecture349177.
The contribution is an explicit finite counterexample; no minimality, uniqueness, higher-stage theorem, or general realization method is claimed. This is AI-assisted work, not external journal peer review. The paper records the exact formalization, trust, interpretation, and prior-art limitations; no worldwide-priority claim is made.