63 citations · 189 across the 26 of their papers we have counts for
4 papers · 1 filter
Modularity and partially observed graphs
Colin McDiarmid, Fiona Skerman
Suppose that there is an unknown underlying graph on a large vertex set, and we can test only a proportion of the possible edges to check whether they are present in . If $G…
Random graphs embeddable in order-dependent surfaces
Colin McDiarmid, Sophia Saller
Given a `genus' function , we let be the class of all graphs such that if has order (that is, has vertices) then it is embeddable in a surfa…
Pendant appearances and components in random graphs from structured classes
Colin McDiarmid
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on p…
Classes of graphs embeddable in order-dependent surfaces
Colin McDiarmid, Sophia Saller
Given a function we let be the class of all graphs such that if has order (that is, has vertices) then it is embeddable in some surface of…