A brief, simple proof of Vizing's conjecture

For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written $γ(G)$. In 1963, V.G. Vizing conjectured that $γ(G \square H) \geq γ(G)γ(H)$ where $\square$ stands for the Cartesian product of graphs. In this note, we prove the conjecture.

No reviews yet.

No comments yet.