Abstract
-regular graph G, let M be chosen uniformly at random from the set of all matchings of G, and for \(\) let \(\) be the probability that M does not cover x.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
