English

Vizing's conjecture: a two-thirds bound for claw-free graphs

Combinatorics 2021-11-15 v2

Abstract

We show that for any claw-free graph GG and any graph HH, γ(GH)23γ(G)γ(H)\gamma(G\square H)\geq \frac{2}{3}\gamma(G)\gamma(H), where γ(G)\gamma(G) is the domination number of GG.

Keywords

Cite

@article{arxiv.1607.06936,
  title  = {Vizing's conjecture: a two-thirds bound for claw-free graphs},
  author = {Elliot Krop},
  journal= {arXiv preprint arXiv:1607.06936},
  year   = {2021}
}

Comments

7 pages

R2 v1 2026-06-22T15:02:27.422Z