On a certain numbering of the vertices of a hypergraph
Ladislav Nebeský (1983)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “A characterization of hypergraphs generated by arborescences”
On a certain numbering of the vertices of a hypergraph
On edge independence numbers and edge covering numbers of -uniform hypergraph
František Olejník (1989)
Mathematica Slovaca
Similarity:
Decompositions of complete -uniform hypergraphs into factors with given diameters
Pavel Tomasta (1976)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Hypergraphs with large transversal number and with edge sizes at least four
Michael Henning, Christian Löwenstein (2012)
Open Mathematics
Similarity:
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...