Problems on Matchings and Independent Sets of a Graph

Amitava Bhattacharya, Anupam Mondal, T. Srinivasa Murthy

Let $G$ be a finite simple graph. For $X\subset V(G)$, the difference of $X$, $d(X):=|X|-|N(X)|$ where $N(X)$ is the neighborhood of $X$ and $\max \{d(X):X\subset V(G)\}$…