S. Gerke

collaborators

3 papers

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…

cs.DM2007

Convex sets in acyclic digraphs

P. Balister, S. Gerke, G. Gutin

A non-empty set $X$ of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by $X$ is connected and it is called convex if no two vertices…

cs.DM2007

Algorithms for Generating Convex Sets in Acyclic Digraphs

P. Balister, S. Gerke, G. Gutin +5

A set $X$ of vertices of an acyclic digraph $D$ is convex if $X \neq = \emptyset$ and there is no directed path between vertices of $X$ which contains a vertex not in $X$ . A set $X$ i…

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

Convex sets in acyclic digraphs

Algorithms for Generating Convex Sets in Acyclic Digraphs

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