Intersection patterns of planar sets (Q2197685): Difference between revisions

For the finite family of sets in the plane \(\mathcal{A}=\{A_1,\dots A_n\}\), the authors consider the intersection \(A({\sigma}) =\bigcap_{i\in \sigma}A_{i}\), where \(\sigma\subseteq[n]\), and the nerve of \(\mathcal{A}\) determined by \(N(\mathcal{A})=\{\sigma\subseteq[n]: A({\sigma})\not=\emptyset\}\). They also introduce \(f_k (\mathcal{A})=f_k (N(\mathcal{A}))=|\left \{\sigma\in N(\mathcal{A}):|\sigma |=k+1\right\}|\) and \(f^{\text{ind}}_k (\mathcal{A})=|\{\tau \in N(\mathcal{A}): |\tau|=k+1 \;\mathrm { and } \; \exists \sigma \in N(\mathcal{A}),\,\sigma \supset \tau,\,|\sigma |=k+2\}|\). Then, \(f^{\mathrm{ind}}_k (\mathcal{A}) \leq f_k (\mathcal{A})\leq \binom{n}{k+1}\). The main results of the paper are inequalities of the form \(f_k (\mathcal{A})\leq cf^{\mathrm{ind}}_{k-1} (\mathcal{A})\) (\(c\) is a constant) which are obtained by different assumptions for the family \(\mathcal{A}\).