The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.
The size of a hypergraph and its matching number
Beyond Hamiltonicity of Prime Difference Graphs
The size of $3$-uniform hypergraphs with given matching number and codegree
![QR code for arXiv:2001.00992 [math.CO]](http://oss.arxitics.com/images/favicon.svg)