Let $G=(V,E)$ be a simple undirected graph. Define an *mmd$k$s in $G$* (for 'maximal minimum degree $k$ subset') to be any subset $S$ of $V$ such that

- the subgraph induced by $S$ in $G$ has minimum degree $\geq k$,
- $S$ is $\subseteq$-maximal w.r.t. property 1.

Moreover, for any $k$, let $\mathrm{smmds}(G,k):=\sup\{ \lvert S \rvert \colon\text{$S$ is an mmd$k$s in $G$}\}$.

Moreover, for any class $\mathbb{G}$ of graphs, let $\mathrm{smmds}(\mathbb{G},k):=\sup\{ \mathrm{smmds}(G,k)\colon G\in\mathbb{G}\}$.

My question is whether

*mmd$k$s*'s- the graph invariant $\mathrm{smmds}(\cdot,k)$,

have already been analysed and named in graph theory.

I am interested in understanding how $\mathrm{smmds}(\cdot,k)$, varies, as a function of $k$, for different families of graphs (or certain random graph models).

tendsto be used in a specific, quite different sense nowadays, 'agents' is not usual graph theoretic language. There werelogicalissues too with the OP, too. $\endgroup$ – Peter Heinig Aug 17 '17 at 8:16