Independence in 5-uniform hypergraphs

DOI10.1016/j.disc.2015.10.034zbMath1327.05251OpenAlexW2211321652MaRDI QIDQ898167

Michael A. Henning, Anders Yeo, Alex K. Eustis

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.034

zbMATH Keywords

independencehypergraphtransversaldual hypergraph

Mathematics Subject Classification ID

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

Related Items (7)

Bounds on domination parameters in graphs: a brief survey ⋮ The Tuza–Vestergaard Theorem ⋮ Unnamed Item ⋮ A note on improved upper bounds on the transversal number of hypergraphs ⋮ A new upper bound on the total domination number in graphs with minimum degree six ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Bounds on the domination number of a digraph and its reverse

Cites Work

• Unnamed Item
• Minimum size transversals in uniform hypergraphs
• Hypergraphs with independent neighborhoods
• 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
• Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
• On Representatives of Subsets
• Domination in partitioned graphs
• Total Domination in Graphs
• Independent sets in hypergraphs
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Independence in 5-uniform hypergraphs