An Erdős-Ko-Rado theorem for restricted signed sets (Q2267280)

A restricted signed \(r\)-set is a pair \((A,f)\), where \(A\subseteq [n]=\{1,2,\ldots ,n\}\) is an \(r\)-set and \(f\) is a map from \(A\) to \([n]\) with \(f(i)\neq i\) for all \(i\in A\). For two restricted signed sets \((A,f)\) and \((B,g)\) an order can be defined as \((A,f)\leq (B,g)\) if \(A\subseteq B\) and \(G|_{A}=f\). A family \({\mathcal A}\) of restricted signed sets on \([n]\) is said to be an intersecting antichain if for any \((A,f),(B,g)\in {\mathcal A}\), they are incomparable and there exists \(x\in A\cap B\) such that \(f(x)=g(x)\). \textit{B. Bollobás} and \textit{I. Leader} [Comput. Math. Appl. 34, No.11, 9--13 (1997; Zbl 0901.05088)] presented an Erdős, Ko and Rado (EKR) theorem for \(q\)-signed sets where \(q\geq 2\) and \textit{C. Y. Ku} and \textit{I. Leader} [Discrete Math. 306, No. 1, 74--86 (2006; Zbl 1088.05072)] established an EKR theorem for partial permutations. In this paper a LYM-type inequality for any intersecting antichain \({\mathcal A}\) of restricted signed sets is given, from which it is shown that \(|{\mathcal A}|\leq {{n-1}\choose {r-1}}(n-1)^{r-1}\) if \({\mathcal A}\) consists of restricted signed \(r\)-sets on \([n]\). Unless \(r=n=3\), equality holds if and only if \({\mathcal A}\) consists of all restricted signed \(r\)-sets \((A,f)\) such that \(x_{0}\in A\) and \(f(x_{0})=\varepsilon _{0}\) for some fixed \(x_{0}\in [n]\), \(\varepsilon _{0}\in [n]\backslash \{x_{0}\}\).