  We show that one-dimensional Euclidean preference profiles can not be
characterized in terms of finitely many forbidden substructures. This result is
in strong contrast to the case of single-peaked and single-crossing preference
profiles, for which such finite characterizations have been derived in the
literature.
