John Sylvester

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Tangled Paths: A Random Graph Model from Mallows Permutations

Jessica Enright, Kitty Meeks, William Pettersson +1

We introduce the random graph $P (n, q)$ which results from taking the union of two paths of length $n \geq 1$ , where the vertices of one of the paths have been relabelled a…

math.CO2024

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes

Ãdouard Bonnet, Julien Duron, John Sylvester +2

We show that for any natural number $s$ , there is a constant $I^^{3}$ and a subgraph-closed class having, for any natural $n$ , at most $Î³^n$ graphs on $n$ vertices up to isomorphism,…