A note on improved upper bounds on the transversal number of hypergraphs

DOI10.1142/S1793830919500046zbMath1404.05137OpenAlexW2900211366MaRDI QIDQ4621301

Michael A. Henning, Nader Jafari Rad

Publication date: 11 February 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500046

zbMATH Keywords

hypergraphtransversalsindependence numbertotal domination

Mathematics Subject Classification ID

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

Related Items (2)

Bounds on domination parameters in graphs: a brief survey ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum size transversals in uniform hypergraphs
• Transversals and matchings in 3-uniform hypergraphs
• Independence in 5-uniform hypergraphs
• Total domination of graphs and small transversals of hypergraphs
• A survey of selected recent results on total domination in graphs
• Extremal uncrowded hypergraphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Transversal numbers of uniform hypergraphs
• Hypergraphs with large transversal number
• Transversals and independence in linear hypergraphs with maximum degree two
• Linear hypergraphs with large transversal number and maximum degree two
• Hypergraphs with large transversal number and with edge sizes at least 3
• On the Independence Number of Steiner Systems
• Total Domination in Graphs
• Independent sets in hypergraphs
• On independent sets in hypergraphs

This page was built for publication: A note on improved upper bounds on the transversal number of hypergraphs