2 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Nina Kamčev, Michael Krivelevich, Natasha Morrison +1
Say that a graph G has property K if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set $N:= \binom{n…