Small maximal matchings of random cubic graphs |
| |
Authors: | H. Assiyatun W. Duckworth |
| |
Affiliation: | 1. Department of Mathematics, Institut Teknologi Bandung, Bandung 40132, Indonesia;2. Mathematical Sciences Institute, Australian National University, Canberra, ACT 2000, Australia |
| |
Abstract: | We consider the expected size of a smallest maximal matching of cubic graphs. Firstly, we present a randomized greedy algorithm for finding a small maximal matching of cubic graphs. We analyze the average‐case performance of this heuristic on random n‐vertex cubic graphs using differential equations. In this way, we prove that the expected size of the maximal matching returned by the algorithm is asymptotically almost surely (a.a.s.) less than 0.34623n. We also give an existence proof which shows that the size of a smallest maximal matching of a random n‐vertex cubic graph is a.a.s. less than 0.3214n. It is known that the size of a smallest maximal matching of a random n‐vertex cubic graph is a.a.s. larger than 0.3158n. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 293–323, 2009 |
| |
Keywords: | matchings random cubic graphs |
|
|