### Abstract

Consider all k-element subsets and ℓ-element subsets (k>ℓ) of an n-element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding ℓ-element set is a subset of the corresponding k-element set. Let G
_{k,ℓ}
denote this graph The domination number of G
_{k,1}
will exactly be determined. We also give lower and upper estimates on the domination number G
_{k,2}
and pose a conjecture of asymptotic nature.

Original language | English |
---|---|

Journal | Discrete Applied Mathematics |

DOIs | |

Publication status | Published - Jan 1 2019 |

### Fingerprint

### Keywords

- Domination number
- Transversal design
- Turán theorem

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

### Cite this

*Discrete Applied Mathematics*. https://doi.org/10.1016/j.dam.2019.02.006