S. Gerke

most citedConnectivity of the Uniform Random Intersection Graph

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2008★ 2 cited

Connectivity of the Uniform Random Intersection Graph

Simon R. Blackburn, Stefanie Gerke

A \emph{uniform random intersection graph} $G (n, m, k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from…

math.CO2008

On the number of graphs not containing $K_{3, 3}$ as a minor

S. Gerke, O. Gimenez, M. Noy +1

We derive precise asymptotic estimates for the number of labelled graphs not containing $K_{3, 3}$ as a minor, and also for those which are edge maximal. Additionally, we establish…

Connectivity of the Uniform Random Intersection Graph

On the number of graphs not containing K3,3​ as a minor

On the number of graphs not containing $K_{3, 3}$ as a minor