Tight bounds on adjacency labels for monotone graph classes

Édouard Bonnet, Julien Duron, John Sylvester +2

A class of graphs admits an adjacency labeling scheme of size $b(n)$, if the vertices in each of its $n$-vertex graphs can be assigned binary strings (called labels) of length $b(n…