An intersection theorem for weighted sets
A family \(\mathcal F\) of subsets of \([ n ]:=\{1, \dots, n\}\) is called intersecting in \([ m ]\) if \(F\cap G\cap [ m ]\neq\varnothing\) for all \(F, G \in \mathcal F\). A function \(\omega\) which assigns to every subset of \([ n ]\) a nonnegative number is said to be shift-monotone in \([ n ] \setminus [ m ]\) if \(\omega(\{a_1, \dots, a_j\})\geq \omega(\{b_1, \dots, b_j\})\) holds for all \(\{a_1, \dots, a_j\}, \{b_1, \ldots b_j\} \subseteq [ n ]\) with \(a_i\leq b_i\), \(i=1,\dots ,j\), \(j=1, \dots ,n\) and if \(\omega(A)\geq \omega(B)\) holds for all \(A,B\subseteq [ n ]\) with \(A\subseteq B\) and \(B\setminus A\subseteq \{m+1, \dots, n\}\). Let \(\omega (\mathcal F)=\sum_{F \in \mathcal F} \omega (F)\). Using methods of Ahlswede and Khachatrian the author proves that the following equality holds for families \(\mathcal F\) of subsets of \([ n ]\) provided that \(\omega\) is shift-monotone in \([ n ] \setminus [ m ]\): NEWLINE\[NEWLINE\max\{\omega (\mathcal F)\mid \mathcal F \text{ is intersecting in }[ n ]\}= \max\{ \omega (\mathcal F)\mid \mathcal F \text{ is intersecting in }[ m ]\}.NEWLINE\]NEWLINE The result is applied to the poset of colored subsets of a finite set.
- The weighted complete intersection theorem
- An intersection theorem for set-valued mappings
- Intersection theorems for multisets
- scientific article; zbMATH DE number 5510826
- An intersection theorem for systems of sets
- An intersection theorem and related problems
- Some intersection theorems
- An intersection/union theorem for several families of finite sets
- A cross‐intersection theorem for subsets of a set
- An intersection theorem for systems of finite sets
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Weight functions on the Kneser graph and the solution of an intersection problem of Sali
- An Erdős-Ko-Rado theorem for unions of length 2 paths
- The weighted complete intersection theorem
- Some results on the weights of -structures
- scientific article; zbMATH DE number 91004 (Why is no real title available?)
- scientific article; zbMATH DE number 1150277 (Why is no real title available?)
- A sharp bound for the product of weights of cross-intersecting families
- Intersecting families, signed sets, and injection
- On the Holroyd-Talbot conjecture for sparse graphs
- Strongly intersecting integer partitions
- An identity in combinatorial extremal theory
- Multiple cross-intersecting families of signed sets
This page was built for publication: An intersection theorem for weighted sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937926)
