An improved bound in Vizing's conjecture
Combinatorics
2017-10-27 v3
Abstract
A well-known conjecture of Vizing is that for any pair of graphs , where is the domination number and is the Cartesian product of and . Suen and Tarr, improving a result of Clark and Suen, showed . We further improve their result by showing
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}
}