Bounds on upper transversals in hypergraphs

DOI10.1007/S10878-019-00456-4zbMATH Open1434.05111OpenAlexW2980367328MaRDI QIDQ2292129FDOQ2292129

Authors: Michael A. Henning, A. 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

Recommendations

• Upper transversals in hypergraphs
• scientific article; zbMATH DE number 7666858
• A note on improved upper bounds on the transversal number of hypergraphs
• On upper transversals in 3-uniform hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
• Total transversals in hypergraphs and their applications
• Bounds on the game transversal number in hypergraphs
• Bounded transversals in multipartite graphs
• Transversals and domination in uniform hypergraphs

zbMATH Keywords

transversalupper transversal\(k\)-transversal number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)

Cites Work

• Small transversals in hypergraphs
• Transversal numbers of uniform hypergraphs
• Title not available (Why is that?)
• Total domination of graphs and small transversals of hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
• Strong transversals in hypergraphs and double total domination in graphs
• Transversals and domination in uniform hypergraphs
• Algorithmic construction of sets for k -restrictions
• On the hardness of approximating minimization problems
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Hypergraphs with large transversal number
• Minimum size transversals in uniform hypergraphs
• Total transversals and total domination in uniform hypergraphs
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• Title not available (Why is that?)
• 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
• A global parallel algorithm for the hypergraph transversal problem
• Computing and Combinatorics
• Upper transversals in hypergraphs
• On upper transversals in 3-uniform hypergraphs

Cited In (5)

• On the number of minimal transversals in 3-uniform hypergraphs
• A Lower Bound for the HBC Transversal Hypergraph Generation
• Bounds on the game transversal number in hypergraphs
• (In)approximability of maximum minimal FVS
• The finite upper half space and related hypergraphs

This page was built for publication: Bounds on upper transversals in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292129)