On independent random points U1,⋯ ,Un distributed uniformly on [0,1]d, a random graph Gn(x) is constructed in which two distinct such points are joined by an edge if the l∞-distance between them is at ...

Every link in ℝ3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams. Journal Information This monthly journal, begun in 1950, is devoted ...