Name
Abstract | ||
|---|---|---|
Let H be a hypergraph on a finite set V. A cover of H is a set of vertices that meets all edges of H. If W is not a cover of H, then W is said to be a noncover of H. The noncover complex of H is the abstract simplicial complex whose faces are the noncovers of H. In this paper, we study homological properties of noncover complexes of hypergraphs. In particular, we obtain an upper bound on their Leray numbers. The bound is in terms of hypergraph domination numbers. Also, our proof idea is applied to compute the homotopy type of the noncover complexes of certain uniform hypergraphs, called tight paths and tight cycles. This extends to hypergraphs known results on graphs. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jcta.2021.105408 | Journal of Combinatorial Theory, Series A |
Keywords | DocType | Volume |
Hypergraph domination numbers,Independence complexes,Noncover complexes,Homological connectivity,Leray numbers | Journal | 180 |
ISSN | Citations | PageRank |
0097-3165 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin-ha Kim | 1 | 329 | 18.78 |
| Minki Kim | 2 | 0 | 0.34 |