Some results on Vizing’s conjecture and related problems
✍ Scribed by Marcin Pilipczuk; Michał Pilipczuk; Riste Škrekovski
- Book ID
- 119225028
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 238 KB
- Volume
- 160
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Vizing's conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this paper we survey the approaches to this central conjecture from domination theory and give some new results alo
The Evasiveness Conjecture for graph properties has natural generalizations to simplicial complexes and to set systems. In this paper we show that the Evasiveness Conjecture for simplicial complexes holds in dimension 2 and 3. We also present an infinite class of counterexamples to the Generalized A