A NOTE ON THE UNIQUENESS OF SOLUTIONS FOR THE YAMABE PROBLEM

Using recent results on the compactness of the space of solutions of the Yamabe problem, we show that in conformal classes of metrics near the class of a nondegenerate solution which is unique (up to scaling) the Yamabe problem has a unique solution as well. This provides examples of a local extension, in the space of conformal classes, of a well-known uniqueness criterion due to Obata.

UNIVERSALITY OF RANDOM GRAPHS

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs satisfying certain pseudorandom properties. We also prove a counterpart result for random bipartite graphs, where the threshold number of edges is even smaller but the embedding is randomized.