All Questions

Suppose we have a complete graph on $2n$ vertices with one "infected" vertex. At each time step, we form a matching of the vertices. Then the vertices paired with infected vertices will also ...

A directed cycle-cover of a digraph $D$ is in the sense of this post equivalent to a perfect matching in the related undirected biadjacency graph $B$ in which the edges connect a vertex $u$ of $D$ in ...

I have by accident found an interesting kind of spanner of complete symmetric graphs $G(V,E)$ with weighted edges. What I actually had planned was to implement an algorithm for calculating certain non-...