A theorem is proved stating that the set of all "minimax links," defined as links minimizing, over paths, the maximum length of links in any path connecting a pair of objects comprising nodes in an undirected weighted graph, comprises the union of all minimum spanning trees of that graph. (Author/SLD)

Structural models that yield circumplex inequality patterns are reviewed, focusing on a model developed by T. W. Anderson (1960). A modification is proposed to this model to allow for negative correlations. This model may be reparameterized as a factor analysis model with nonlinear constraints on the factor loadings. (SLD)