Hypergraphs with large transversal number and with edge sizes at least four
From MaRDI portal
Publication:424115
DOI10.2478/s11533-012-0023-9zbMath1242.05192OpenAlexW2096007494MaRDI QIDQ424115
Christian Löwenstein, Michael A. Henning
Publication date: 31 May 2012
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-012-0023-9
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (17)
A characterization of hypergraphs with large domination number ⋮ Domination in intersecting hypergraphs ⋮ Bounds on the game transversal number in hypergraphs ⋮ Total transversals and total domination in uniform hypergraphs ⋮ On the transversal number of rank \(k\) hypergraphs ⋮ On the transversal number of \(k\)-uniform connected hypergraphs ⋮ Extremal hypergraphs for matching number and domination number ⋮ A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem ⋮ Domination game on uniform hypergraphs ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ Transversals in 4-uniform hypergraphs ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ Matching criticality in intersecting hypergraphs ⋮ Total Transversals in Hypergraphs and Their Applications ⋮ A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
Cites Work
This page was built for publication: Hypergraphs with large transversal number and with edge sizes at least four
