Boundary Framework, Rear Morphology, and Rectangular Ears in the Partition Graph

We study the outer geometry of the partition graph $G_n$, focusing on its canonical front-and-side framework, the family of nontrivial rectangular partitions, and the rear structures suggested by the visible geometry of the graph. We formalize the boundary framework ${\mathcal{B}}_n={\mathcal{M}}_n\cup {\mathcal{L}}_n\cup {\mathcal{R}}_n$, where ${\mathcal{M}}_n$ is the main chain and ${\mathcal{L}}_n,{\mathcal{R}}_n$ are the left and right side edges, and we isolate the nontrivial rectangular family ${\mathrm{R}\mathrm{e}\mathrm{c}\mathrm{t}}^{\ast }(n)=\{(a^b):ab=n,a,b\ge 2\}$ as a canonical discrete family marking the rear part of $G_n$. We prove that every nontrivial rectangular vertex $\rho =(a^b)$ has degree $2$, has exactly two explicitly described neighbors, and lies in a unique triangle of $G_n$. This leads to the notions of a rectangular ear, its attachment pair, and its support edge. We also prove that ${\mathrm{R}\mathrm{e}\mathrm{c}\mathrm{t}}^{\ast }(n)$ is an independent set in $G_n$, so the weak rectangular contour is not a graph-theoretic chain but a discrete rear marker family. For every genuinely rear rectangular ear, namely for $a,b\ge 3$, we show that its support edge lies in a tetrahedral configuration of the clique complex $K_n=\mathrm{C}\mathrm{l}(G_n)$. To organize the interaction between different ears, we introduce support zones, support distances, and support corridors between attachment pairs. The paper also records a natural divisor-theoretic indexing of the rectangular family, presents a computational atlas in small and large ranges, and concludes with open problems concerning support-zone connectivity, inter-ear corridors, and canonical rear contours in $G_n$.