Noncover complexes, independence complexes, and domination numbers of hypergraphs

MaRDI QIDQ2199838zbMATH OpenFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

domination numbershomological connectivityindependence complexesLeray numbersnoncover complexes

Mathematics Subject Classification ID

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

Recommendations

• Domination numbers and noncover complexes of hypergraphs
• Dominance complexes and vertex cover numbers of graphs
• On domination and independence numbers of graphs
• scientific article; zbMATH DE number 734465
• Interrelations among the notions of independence, domination and full sets in a hypergraph
• Complexes of graphs with bounded independence number
• Complexes of graphs with bounded independence number
• Independence complexes of well-covered circulant graphs
• Hypergraph domination and strong independence
• Distance \(r\)-domination number and \(r\)-independence complexes of graphs

Cites work

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

Cited in

(6)

• Domination numbers and homology
• Domination numbers and noncover complexes of hypergraphs
• Collapsibility of non-cover complexes of graphs
• Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number
• Dominance complexes and vertex cover numbers of graphs
• Independence complexes and edge covering complexes via Alexander duality

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

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