Transversals in 4-uniform hypergraphs
From MaRDI portal
Publication:727047
zbMath1351.05221MaRDI QIDQ727047
Anders Yeo, Michael A. Henning
Publication date: 6 December 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p50
Hypergraphs (05C65) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs ⋮ Transversals in regular uniform hypergraphs ⋮ The Tuza–Vestergaard Theorem ⋮ Dominating vertex covers: the vertex-edge domination problem ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded
Cites Work
- Hypergraphs with large transversal number and with edge sizes at least four
- Transversals and domination in uniform hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Hypergraphs with large transversal number
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Domination in partitioned graphs
- Total Domination in Graphs
- The Tuza–Vestergaard Theorem
This page was built for publication: Transversals in 4-uniform hypergraphs
