Adjacency labeling schemes and induced-universal graphs

TL;DR

This paper introduces optimal adjacency labeling schemes for various graph classes, enabling adjacency determination from compact labels, and constructs minimal induced-universal graphs, solving longstanding open problems in graph theory.

Contribution

It presents the first near-optimal adjacency labeling scheme for undirected graphs and constructs minimal induced-universal graphs, improving upon decades-old bounds and solving open problems.

Findings

Labels of size n/2 + O(1) bits suffice for adjacency queries.

Induced-universal graphs with O(2^{n/2}) vertices are constructed.

Results are extended to directed graphs, tournaments, and bipartite graphs.

Abstract

We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n/2+O(1)$ bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible to decide whether or not the vertices are adjacent in the graph. This is optimal, up to an additive constant, and constitutes the first improvement in almost 50 years of an $n/2+O(\log n)$ bound of Moon. As a consequence, we obtain an induced-universal graph for $n$-vertex graphs containing only $O(2^{n/2})$ vertices, which is optimal up to a multiplicative constant, solving an open problem of Vizing from 1968. We obtain similar tight results for directed graphs, tournaments and bipartite graphs.