John Sylvester

collaborators

3 papers

math.CO2024

Functionality of Random Graphs

John Sylvester, Viktor Zamaraev, Maksim Zhukovskii

The functionality of a graph $G$ is the minimum number $k$ such that in every induced subgraph of $G$ there exists a vertex whose neighbourhood is uniquely determined by the neighb…

math.CO2024

Boolean combinations of graphs

Sarosh Adenwalla, Samuel Braunfeld, John Sylvester +1

Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea ap…

math.CO2024

Adjacency Labeling Schemes for Small Classes

Édouard Bonnet, Julien Duron, John Sylvester +1

A graph class admits an implicit representation if, for every positive integer $n$ , its $n$ -vertex graphs have a $O (lo g n)$ -bit (adjacency) labeling scheme, i.e., their vertices c…