Bounds on upper transversals in hypergraphs
From MaRDI portal
Publication:2292129
DOI10.1007/s10878-019-00456-4zbMath1434.05111OpenAlexW2980367328MaRDI QIDQ2292129
Michael A. Henning, Anders Yeo
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00456-4
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Transversals and domination in uniform hypergraphs
- A global parallel algorithm for the hypergraph transversal problem
- Total domination of graphs and small transversals of hypergraphs
- Small transversals in hypergraphs
- On upper transversals in 3-uniform hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- Hypergraphs with large transversal number
- Upper transversals in hypergraphs
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Algorithmic construction of sets for k -restrictions
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- On the hardness of approximating minimization problems
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Computing and Combinatorics
This page was built for publication: Bounds on upper transversals in hypergraphs
