# Melnikov, L. S.

## Melnikov's valency-variety problem ★

Author(s): Melnikov

\begin{problem} The valency-variety $w(G)$ of a graph $G$ is the number of different degrees in $G$. Is the chromatic number of any graph $G$ with at least two vertices greater than $$\ceil{ \frac{\floor{w(G)/2}}{|V(G)| - w(G)} } ~ ?$$ \end{problem}

Keywords: