, Volume 27, Issue 4, pp 473–487

Total domination of graphs and small transversals of hypergraphs


DOI: 10.1007/s00493-007-2020-3

Cite this article as:
Thomassé, S. & Yeo, A. Combinatorica (2007) 27: 473. doi:10.1007/s00493-007-2020-3


The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m, the transversal has at most 3n/7 vertices, and this bound is sharp in the complement of the Fano plane. Chvátal and McDiarmid [5] proved that every 3-uniform hypergraph with n vertices and edges has a transversal of size n/2. Two direct corollaries of these results are that every graph with minimal degree at least 3 has total domination number at most n/2 and every graph with minimal degree at least 4 has total domination number at most 3n/7. These two bounds are sharp.

Mathematics Subject Classification (2000)


Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.LIRMMMontpellier Cedex 5France
  2. 2.Department of Computer Science Royal HollowayUniversity of LondonEgham SurreyUK