Sparse universal graphs for planarity

by   Louis Esperet, et al.

We show that for every integer n≥ 1 there exists a graph G_n with (1+o(1))n vertices and n^1 + o(1) edges such that every n-vertex planar graph is isomorphic to a subgraph of G_n. The best previous bound on the number of edges was O(n^3/2), proved by Babai, Chung, Erdős, Graham, and Spencer in 1982. We then show that for every integer n≥ 1 there is a graph U_n with n^1 + o(1) vertices and edges that contains induced copies of every n-vertex planar graph. This significantly reduces the number of edges in a recent construction of the authors with Dujmović, Gavoille, and Micek.


page 1

page 2

page 3

page 4


Universal Geometric Graphs

We introduce and study the problem of constructing geometric graphs that...

Supercards, Sunshines and Caterpillar Graphs

The vertex-deleted subgraph G-v, obtained from the graph G by deleting t...

Graphical Construction of Spatial Gibbs Random Graphs

We present a Spatial Gibbs Random Graphs Model that incorporates the int...

Temporal Cliques admit Sparse Spanners

Let G=(G,λ) be a labeled graph on n vertices with λ:E_G→N a locally inj...

Almost-Optimal Sublinear Additive Spanners

Given an undirected unweighted graph G = (V, E) on n vertices and m edge...

Computing k-Modal Embeddings of Planar Digraphs

Given a planar digraph G and a positive even integer k, an embedding of ...

Sharp bounds for the chromatic number of random Kneser graphs

Given positive integers n> 2k, a Kneser graph KG_n,k is a graph whose ve...

Please sign up or login with your details

Forgot password? Click here to reset