On chromatic and achromatic numbers of uniform hypergraphs
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “Theorems of the Nordhaus-Gaddum type for -uniform hypergraphs”
On chromatic and achromatic numbers of uniform hypergraphs
Domatic numbers of uniform hypergraphs
Bohdan Zelinka (1985)
Archivum Mathematicum
Similarity:
Rainbow -factors of complete -uniform -partite hypergraphs.
Chen, Ailian, Zhang, Fuji, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On total matching numbers and total covering numbers for -uniform hypergraphs
František Olejník (1984)
Mathematica Slovaca
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...