We show that for every integer n≥1 there exists a graph Gn with n1+o(1) edges such that every n-vertex planar graph is isomorphic to a subgraph of Gn. The best previous bound on the number of edges was O(n3/2), proved by Babai, Erd\H{o}s, Chung, Graham, and Spencer in 1982