Trees are basic in graph theory and its applications to many fields, such as chemistry, electric network theory, and the theory of games. König [7; 47-48] gives an interesting historical account of independent discoveries of trees by Kirchhoff, Cayley, Sylvester, Jordan, and others who were working in a variety of fields.

There are many equivalent ways of defining trees, the most common being: A tree is a graph which is connected and has no circuits. Figure 1 shows the trees with up to six vertices; those with up to 10 vertices can be found in Harary [5; 233–234]. Some other possible definitions of a tree are the following: (1) A tree is a graph which is connected and has one more vertex than edge. (2) A tree is a graph which has no circuits and has one more vertex than edge. For these and other characterizations see Berge [4; 152ff.] and Harary [5; 32ff.]. A less common definition is by induction: The graph consisting of a single vertex is a tree, and a tree with n + 1 vertices is obtained from a tree with n vertices by adding a new vertex adjacent to exactly one other vertex.

Every n-dimensional manifold admits an embedding in R2n by the result of H. Whitney [11]. Lie groups are parallelizable and so by the theorem of M. W. Hirsch [5] there is an immersion of any Lie group in codimension one. However no general theorem is known which asserts that a parallelizable manifold embeds in Euclidean space of dimension less than 2n. Here we give a method for constructing smooth embeddings of compact Lie groups in Euclidean space. The construction is a fairly direct one using the geometry of the Lie group, and works very well in some cases. It does not give reasonable results for the group Spin (n) except for low values of n. We also give a method for constructing some embeddings of Spin (n), this uses the embedding of SO(n) that was constructed by the general method and an embedding theorem of A. Haefliger [3]. Although this is a very ad hoc method, it has some interest as it seems to be the first application of Haefliger's theorem which gives embedding results appreciably below twice the dimension of the manifold. The motivation for this work was to throw some light on the problem of the existence of low codimensional embeddings of parallelizable manifolds.