An improved constant for Vizing's conjecture
arXiv:2607.01109
Abstract
For any graph , a subset dominates if . The minimum cardinality over all such is called the domination number, written . The classical conjecture of V.G. Vizing states that where stands for the Cartesian product of graphs. In this paper, we apply well-known results to prove the Vizing-type inequality .
Algebraic mistake