English

An improved bound in Vizing's conjecture

Combinatorics 2017-10-27 v3

Abstract

A well-known conjecture of Vizing is that γ(GH)γ(G)γ(H)\gamma(G \square H) \ge \gamma(G)\gamma(H) for any pair of graphs G,HG, H, where γ\gamma is the domination number and GHG \square H is the Cartesian product of GG and HH. Suen and Tarr, improving a result of Clark and Suen, showed γ(GH)12γ(G)γ(H)+12min(γ(G),γ(H))\gamma(G \square H) \ge \frac{1}{2}\gamma(G)\gamma(H) + \frac{1}{2}\min(\gamma(G),\gamma(H)). We further improve their result by showing γ(GH)12γ(G)γ(H)+12max(γ(G),γ(H)).\gamma(G \square H) \ge \frac{1}{2}\gamma(G)\gamma(H) + \frac{1}{2}\max(\gamma(G),\gamma(H)).

Keywords

Cite

@article{arxiv.1706.03682,
  title  = {An improved bound in Vizing's conjecture},
  author = {Shira Zerbib},
  journal= {arXiv preprint arXiv:1706.03682},
  year   = {2017}
}
R2 v1 2026-06-22T20:16:21.921Z