
arXiv: 1310.7359
In 2012, the first three authors 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.
hypergraph, Hypergraphs, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), 05C65, 05C69, Transversal (matching) theory, total transversal, FOS: Mathematics, total domination, Mathematics - Combinatorics, Combinatorics (math.CO)
hypergraph, Hypergraphs, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), 05C65, 05C69, Transversal (matching) theory, total transversal, FOS: Mathematics, total domination, Mathematics - Combinatorics, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
