Independence in 5-uniform hypergraphs

DOI10.1016/J.DISC.2015.10.034MaRDI QIDQ898167zbMATH OpenOpenAlexFDO

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

independencetransversalhypergraphdual hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Improved lower bounds on k‐independence
• On vertex independence number of uniform hypergraphs
• On independent sets in hypergraphs
• New results on \(k\)-independence of hypergraphs
• Differential Methods for Finding Independent Sets in Hypergraphs

Cites work

• scientific article; zbMATH DE number 1534644 (Why is no real title available?)
• A Theorem on Coloring the Lines of a Network
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Domination in partitioned graphs
• Hypergraphs with independent neighborhoods
• Hypergraphs with large transversal number
• Independent sets in hypergraphs
• Minimum size transversals in uniform hypergraphs
• On Representatives of Subsets
• Small transversals in hypergraphs
• Total domination in graphs
• Total domination of graphs and small transversals of hypergraphs
• Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five

Cited in

(20)

• My favorite domination conjectures in graph theory are bounded
• On subgraphs of bounded degeneracy in hypergraphs
• Bounds on the domination number of a digraph and its reverse
• On vertex independence number of uniform hypergraphs
• On independent sets in hypergraphs
• Differential Methods for Finding Independent Sets in Hypergraphs
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
• Independence densities of hypergraphs
• A note on the caro-tuza bound on the independence number of uniform hypergraphs
• Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
• A note on improved upper bounds on the transversal number of hypergraphs
• The Tuza–Vestergaard Theorem
• Independence number of hypergraphs under degree conditions
• scientific article; zbMATH DE number 7666858 (Why is no real title available?)
• A new upper bound on the total domination number in graphs with minimum degree six
• Finding Large Independent Sets in Graphs and Hypergraphs
• Bounds on domination parameters in graphs: a brief survey
• A recursive theta body for hypergraphs
• On the independence number of non-uniform uncrowded hypergraphs
• A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\)

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

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