← All problems

Nonexistence conjecture for dendrimer nanostars of at least four stages

6 years old · traced to

A dendrimer nanostar is the nanostar structure obtained by growing a dendrimer through a specified number of stages; a graph is a GϕG_\phi-graph if it is realized as Gϕ(A)G_\phi(A) for an appropriate set AA, using the Euler ϕ\phi function as in the paper. Nonexistence conjecture for dendrimer nanostars. There is no dendrimer nanostar which has grown at least four stages, as a GϕG_\phi-graph. The paper proves that the two-stage nanostar D2D_2 is a GϕG_\phi-graph, while reporting that attempts to prove nonexistence for nanostars grown through at least four stages have failed; the conjecture remains open.

References
  1. Nima Ghanbari and Saeid Alikhani, “A graph related to Euler ϕ function”, arXiv:2012.12492 (2020).

Progress summary

Refreshed
Open · progress reported

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 GϕG_\phi-graph. The source confirms that the two-stage case is realizable and records the four-stage nonexistence claim as open.

Known results

  • Every GϕG_\phi-graph is a tree.
  • Every path PnP_n with n>1n>1 is a GϕG_\phi-graph.
  • The star K1,nK_{1,n} is not a GϕG_\phi-graph for n>4n>4.
  • The two-stage nanostar D2D_2 is a GϕG_\phi-graph, using A={3,256,376,384,564}A=\{3,256,376,384,564\}.

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 GϕG_\phi-graph isomorphic to the four-stage nanostar D4D_4, with 8888 vertices and 8787 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 solutionHide full solution

Under the contracted-hexagon interpretation of the nanostar recursion, the four-stage tree D4D_4 is a GϕG_\phi-graph. The interpretation is supported by the source figures and the cited construction; it is not an explicit contraction definition in the source.

Take

A={3,167,334,19577,31657,39154,63314,702085,983055,1048576,1123336,1975461,2370559,2633948,3352289,3561823,4182461,4741118,5019445,5866457,8031112,8364922,11732914}A=\{3,167,334,19577,31657,39154,63314,702085,983055,1048576,1123336,1975461,2370559,2633948,3352289,3561823,4182461,4741118,5019445,5866457,8031112,8364922,11732914\}.

The iterated Euler-totient orbit of AA, 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 D4D_4 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.