Noncover complexes, independence complexes, and domination numbers of hypergraphs

MaRDI QIDQ2199838

Jinha Kim, Min-Ki Kim

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2020//46.html

zbMATH Keywords

independence complexesdomination numbershomological connectivityLeray numbersnoncover complexes

Mathematics Subject Classification ID

Hypergraphs (05C65) Homological dimension and commutative rings (13D05) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Domination numbers and noncover complexes of hypergraphs

Cites Work

• Total transversals and total domination in uniform hypergraphs
• A topological colorful Helly theorem
• Intersections of Leray complexes and regularity of monomial ideals
• The clique complex and hypergraph matching
• Note: Combinatorial Alexander duality -- a short and elementary proof
• Triangulated spheres and colored cliques
• Projective dimension, graph domination parameters, and independence complex homology
• Collapsibility of non-cover complexes of graphs
• Further applications of clutter domination parameters to projective dimension
• Domination in hypergraphs
• A geometric Hall-type theorem
• Hall's theorem for hypergraphs

This page was built for publication: Noncover complexes, independence complexes, and domination numbers of hypergraphs