scholarly journals Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited

2020 ◽  
Vol 29 (3) ◽  
pp. 193-209
Author(s):  
János Barát
Keyword(s):  
Covering Number ◽  
Maximal Covering ◽  
Intersecting Hypergraphs

scholarly journals Collapsibility of Simplicial Complexes of Hypergraphs

10.37236/8364 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Alan Lew
Keyword(s):  
Simplicial Complex ◽  
Simplicial Complexes ◽  
Covering Number ◽  
Uniform Hypergraph ◽  
Intersecting Hypergraphs

Let $\mathcal{H}$ be an $r$-uniform hypergraph. We show that the simplicial complex whose simplices are the hypergraphs $\mathcal{F}\subset\mathcal{H}$ with covering number at most $p$ is $\left(\binom{r+p}{r}-1\right)$-collapsible. Similarly, the simplicial complex whose simplices are the pairwise intersecting hypergraphs $\mathcal{F}\subset\mathcal{H}$ is $\frac{1}{2}\binom{2r}{r}$-collapsible.

Minmax Regret Maximal Covering Location Problems with Edge Demands

2020 ◽  
pp. 105181
Author(s):  
Marta Baldomero-Naranjo ◽  
Jörg Kalcsics ◽  
Antonio M. Rodríguez-Chía
Keyword(s):  
Location Problems ◽  
Maximal Covering ◽  
Minmax Regret

scholarly journals Uniform intersecting families with covering number four

1995 ◽  
Vol 71 (1) ◽  
pp. 127-145 ◽  
Author(s):  
Peter Frankl ◽  
Katsuhiro Ota ◽  
Norihide Tokushige
Keyword(s):  
Covering Number ◽  
Intersecting Families

Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem

2020 ◽  
pp. 126-138
Author(s):  
Matheus de Araujo Butinholi ◽  
Alexandre Xavier Martins ◽  
Paganini Barcellos de Oliveira ◽  
Diego Perdigão Martino
Keyword(s):  
Covering Problem ◽  
Maximal Covering ◽  
Maximal Covering Problem ◽  
Single Allocation
Sign in / Sign up

Export Citation Format

Share Document