The size of uniquely colorable graphs (Q2641312): Difference between revisions

In this paper it is proved that for every uniquely k-colourable graph G the following inequality holds: \(| E(G)| \geq (k-1)| V(G)| -\left( \begin{matrix} k\\ 2\end{matrix} \right)\) and the bound is the best possible; it is also conjectured that all extremal graphs relatively to this inequality contain a \(K_ k\) as their subgraph.