Vizing's Conjecture for Almost All Pairs of Graphs

For any graph $G=(V,E)$, a subset $S\subseteq V$ $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 that if $\left|G\right|\geq γ(G)γ(H)$ and $\left|H\right|\geq γ(G)γ(H)$, then the conjecture holds. This result quickly implies Vizing's conjecture for almost all pairs of graphs $G,H$ with $\left|G\right|\geq \left|H\right|$, satisfying $\left|G\right|\leq q^{\frac{\left|H\right|}{\log_q\left|H\right|}}$ for $q=\frac{1}{1-p}$ and $p$ the edge probability of the Erdős-Rényi random graph.

No reviews yet.

No comments yet.