Optimal interactions for addressable self-assembly are those where strong bonds form a spanning tree of the target structure, proven to prevent monomer depletion as a combinatorial graph property independent of kinetics details.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.soft 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal interactions for addressable self-assembly
Optimal interactions for addressable self-assembly are those where strong bonds form a spanning tree of the target structure, proven to prevent monomer depletion as a combinatorial graph property independent of kinetics details.