EuDML | Browse

Using results of Altshuler and Negami, we present a classification of biembeddings of symmetric configurations of triples in the torus or Klein bottle. We also give an alternative proof of the structure of 3-homogeneous Latin trades.

Bi-Lipschitz embeddings of hyperspaces of compact sets

Jeremy T. Tyson (2005)

Fundamenta Mathematicae

We study the bi-Lipschitz embedding problem for metric compacta hyperspaces. We observe that the compacta hyperspace K(X) of any separable, uniformly disconnected metric space X admits a bi-Lipschitz embedding in ℓ². If X is a countable compact metric space containing at most n nonisolated points, there is a Lipschitz embedding of K(X) in $ℝ^{n + 1}$ ; in the presence of an additional convergence condition, this embedding may be chosen to be bi-Lipschitz. By way of contrast, the hyperspace K([0,1]) of the...

Displaying 1 – 13 of 13

Balanced aspect ratio trees and their use for drawing large graphs.

Balanced Subdivision and Enumeration in Balanced Spheres.

Bartholdi zeta functions of fractal graphs.

Basic polyhedra in knot theory

Baxter permutations and plane bipolar orientations.

Bicubic planar maps

Biembeddings of symmetric configurations and 3-homogeneous Latin trades

Bi-Lipschitz embeddings of hyperspaces of compact sets

Bipartite-uniform hypermaps on the sphere.

Bounded-degree graphs can have arbitrarily large slope numbers.

Bounded-degree graphs have arbitrarily large geometric thickness.

Bounds for orthogonal 3-D graph drawing.

Bridges and Hamiltonian circuits in planar graphs.

Currently displaying 1 – 13 of 13