Adjacency labeling schemes and induced-universal graphs

Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)116-137
Number of pages22
JournalSIAM Journal on Discrete Mathematics
Volume33
Issue number1
DOIs
StatePublished - 2019

Keywords

  • Adjacency labeling schemes
  • Induced universal graphs

Fingerprint

Dive into the research topics of 'Adjacency labeling schemes and induced-universal graphs'. Together they form a unique fingerprint.

Cite this