Blocking Amalgamations, Maximal Arcs, and Generalized Crowns
Let $C^r_{1,k}$ be the $r$-uniform $k$-crown and put $h=r-k+2$. For a finite linear intersecting $r$-uniform hypergraph $G$, let $\tau_h(G)$ be the minimum size of a set meeting every edge of $G$ in at least $h$ vertices, and define \[ \rho_{r,k}=\sup_G\frac{|E(G)|}{\tau_h(G)}. \] We prove that every fixed pair $(G,B)$...