Abstract
Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we characterize the connected hypergraphs that achieve equality in the Lai-Chang bound and in the Chvátal-McDiarmid bound.
Similar content being viewed by others
References
Chvátal V., McDiarmid C., Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26
Henning M.A., Yeo A., Hypergraphs with large transversal number and with edge sizes at least 3, J. Graph Theory, 2008, 59(4), 326–348
Lai F.C., Chang G.J., An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133
Thomassé S., Yeo A., Total domination of graphs and small transversals of hypergraphs, Combinatorica, 2007, 27(4), 473–487
Tuza Zs., Covering all cliques of a graph, Discrete Math., 1990, 86(1–3), 117–126
Yeo A., private communication
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Henning, M.A., Löwenstein, C. Hypergraphs with large transversal number and with edge sizes at least four. centr.eur.j.math. 10, 1133–1140 (2012). https://doi.org/10.2478/s11533-012-0023-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.2478/s11533-012-0023-9