2013/10/28 by Csilla Bujtás, Michael A. Henning, Bujtás, Csilla +6
Computer Science · Engineering · Mathematics · #05C65 #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.CO #msc:05C65 #msc:05C69
paper · pdf · doi:10.48550/arxiv.1310.7359
24 pages
arxiv created 2013/10/28 · openalex publication_date 2013/10/28 · arxiv updated 2013/10/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.