2 problems

Let $\mathcal{F}$ be a $k$-uniform hypergraph, let $\nu(\mathcal{F})$ be its matching number, and let $\tau(\mathcal{F})$ be its covering number, the minimum size of a vertex set m…

Let $H$ be a hypergraph of $d$-intervals, let $\tau_w(H)$ be its weighted covering number, and let $\nu_w(H)$ be its weighted matching number. Weighted covering conjecture. One sho…