Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423374 | Discrete Mathematics | 2014 | 7 Pages |
Abstract
For kâ¥2, let H be a k-uniform hypergraph on n vertices and m edges. The transversal number Ï(H) of H is the minimum number of vertices that intersect every edge. Chvátal and McDiarmid (1992) proved that Ï(H)â¤(n+âk2âm)/(â3k2â). When k=3, the connected hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem were characterized by Henning and Yeo (2008). In this paper, we characterize the connected hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem for k=2 and for all kâ¥4.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael A. Henning, Christian Löwenstein,