Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo
Published 2013-10-28Version 1
The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs. We prove tight asymptotic upper bounds on the total transversal number in terms of the number of vertices, the number of edges, and the edge size.
Equality in a Linear Vizing-Like Relation that Relates the Size and Total Domination Number of a Graph
$(2,2)$-colourings and clique-free $σ$-hypergraphs
On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
![QR code for arXiv:1310.7359 [math.CO]](http://oss.arxitics.com/images/favicon.svg)