We investigate the ratio \(\mathcal{I}(G)\) of the average size of a maximal matching to the size of a maximum matching in a graph G. If many maximal mat...

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they indu...