Let m12, m13, ..., mn−1,n be the slopes of the (2n)
lines connecting n points in general position in the plane. The ideal In
of all algebraic relations among the mij defines a configuration space
called the {\em slope variety of the complete graph}. We prove that In is
reduced and Cohen-Macaulay, give an explicit Gr\"obner basis for it, and
compute its Hilbert series combinatorially. We proceed chiefly by studying the
associated Stanley-Reisner simplicial complex, which has an intricate recursive
structure. In addition, we are able to answer many questions about the geometry
of the slope variety by translating them into purely combinatorial problems
concerning enumeration of trees.Comment: 36 pages; final published versio