Noncover complexes, independence complexes, and domination numbers of hypergraphs
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Homological dimension and commutative rings (13D05)
Cites Work
- Domination in hypergraphs
- Intersections of Leray complexes and regularity of monomial ideals
- Total transversals and total domination in uniform hypergraphs
- Hall's theorem for hypergraphs
- Projective dimension, graph domination parameters, and independence complex homology
- Note: Combinatorial Alexander duality -- a short and elementary proof
- Triangulated spheres and colored cliques
- The clique complex and hypergraph matching
- A topological colorful Helly theorem
- Collapsibility of non-cover complexes of graphs
- Further applications of clutter domination parameters to projective dimension
- A geometric Hall-type theorem
Cited In (6)
- Domination numbers and homology
- Independence complexes and edge covering complexes via Alexander duality
- Domination numbers and noncover complexes of hypergraphs
- Dominance complexes and vertex cover numbers of graphs
- Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number
- Collapsibility of non-cover complexes of graphs
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)
