Sparse universal graphs for planarity

10/12/2020
by   Louis Esperet, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/19/2020

Universal Geometric Graphs

We introduce and study the problem of constructing geometric graphs that...
01/27/2019

Large Minors in Expanders

In this paper we study expander graphs and their minors. Specifically, w...
10/16/2020

Supercards, Sunshines and Caterpillar Graphs

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

Random k-out subgraph leaves only O(n/k) inter-component edges

Each vertex of an arbitrary simple graph on n vertices chooses k random ...
01/14/2022

Covering Many (or Few) Edges with k Vertices in Sparse Graphs

We study the following two fixed-cardinality optimization problems (a ma...
08/23/2019

Graphical Construction of Spatial Gibbs Random Graphs

We present a Spatial Gibbs Random Graphs Model that incorporates the int...
09/28/2018

Temporal Cliques admit Sparse Spanners

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