An improved constant for Vizing's conjecture
组合数学
2026-07-01 v1
摘要
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 .
引用
@article{arxiv.2607.01109,
title = {An improved constant for Vizing's conjecture},
author = {Mohsen Aliabadi and Elliot Krop},
journal= {arXiv preprint arXiv:2607.01109},
year = {2026}
}