中文

An improved constant for Vizing's conjecture

组合数学 2026-07-01 v1

摘要

For any graph G=(V,E)G = (V,E), a subset SVS {\subseteq} V dominates GG if N[S]=VN[S] = V. The minimum cardinality over all such SS is called the domination number, written γ(G){\gamma}(G). The classical conjecture of V.G. Vizing states that γ(GH)γ(G)γ(H){\gamma}(G{\square} H) {\ge} {\gamma}(G){\gamma}(H) where {\square} stands for the Cartesian product of graphs. In this paper, we apply well-known results to prove the Vizing-type inequality γ(GH).5809γ(G)γ(H){\gamma}(G{\square} H) {\ge} .5809 {\gamma}(G){\gamma}(H).

引用

@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}
}