The size of uniquely colorable graphs (Q2641312): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The size of uniquely colorable graphs |
scientific article |
Statements
The size of uniquely colorable graphs (English)
0 references
1990
0 references
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.
0 references
q-tree
0 references
color classes
0 references
uniquely k-colourable graph G
0 references
