Skip to main content

All Questions

2 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3 votes
0 answers
88 views

Infection on a complete graph

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 ...
PoissonSummation's user avatar
0 votes
0 answers
48 views

Spanning subgraphs defined via $K_4$ matchings

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-...
Manfred Weis's user avatar
  • 13.2k