Some remarks on domination
โ Scribed by D. Archdeacon; J. Ellis-Monaghan; D. Fisher; D. Froncek; P.C.B. Lam; S. Seager; B. Wei; R. Yuster
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 49 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
We prove a conjecture of Favaron et al. that every graph of order n and minimum degree at least three has a total dominating set of size at least n/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bound is tight, and (3) a type of bipartite domination and its relation to transversals in hypergraphs. ยฉ 2004 Wiley Periodicals, Inc. J Graph Theory 46: 207โ210, 2004
๐ SIMILAR VOLUMES
## Abstract We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence