OFFSET
3,2
COMMENTS
Conjecturally, a matching exists for every n with at most one unmatched vertex. This would imply a(n) = floor(A007569(n)/2). A computer search, using a simple nonbacktracking algorithm, has shown the existence of such matchings up to n = 22 and indeed for small n there are large numbers of maximum matchings (A292921). Such a matching could also be constructed from a Hamiltonian path (A300551) by selecting every other edge, so a proof that these graphs are Hamiltonian would also suffice. - Andrew Howroyd, Mar 12 2018
LINKS
Eric Weisstein's World of Mathematics, Matching Number
Eric Weisstein's World of Mathematics, Polygon Diagonal Intersection Graph
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Mar 08 2018
EXTENSIONS
a(21)-a(22) from Andrew Howroyd, Mar 12 2018
STATUS
approved