On upper transversals in 3-uniform hypergraphs
From MaRDI portal
Publication:1627202
zbMath1402.05159MaRDI QIDQ1627202
Anders Yeo, Michael A. Henning
Publication date: 22 November 2018
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/v25i4p27
Related Items (4)
Upper transversals in hypergraphs ⋮ Bounds on upper transversals in hypergraphs ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ (In)approximability of maximum minimal FVS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Transversals and domination in uniform hypergraphs
- Two relations between the parameters of independence and irredundance
- An upper bound for the independent domination number
- On the independent domination number of graphs with given minimum degree
- Independent domination in graphs: A survey and recent results
- Hypergraphs with large transversal number
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Graph-theoretic parameters concerning domination, independence, and irredundance
This page was built for publication: On upper transversals in 3-uniform hypergraphs