Related papers: Maximum Intersecting Families of Permutations

For a graph G and integer r\geq 1 we denote the collection of independent r-sets of G by I^{(r)}(G). If v\in V(G) then I_v^{(r)}(G) is the collection of all independent r-sets containing v. A graph G, is said to be r-EKR, for r\geq 1, iff…

A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least…

Let $\mathcal{A}$ be a family of subsets of a finite set. A subfamily of $\mathcal{A}$ is said to be intersecting when any two of its members contain at least one common element. We say that $\mathcal{A}$ is an Erd{\H o}s-Ko-Rado (EKR)…

We show that if a simplicial complex is a near-cone of sufficiently high depth, then the only maximum families of small pairwise intersecting faces are those with a common intersection. Thus, near-cones of sufficiently high depth satisfy…

The \emph{intersection density} of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is the rational number $\rho(G)$ given by the ratio between the maximum size of a subset of $G$ in which any two permutations agree on some…

We consider the following generalization of the seminal Erd\H{o}s-Ko-Rado theorem, due to Frankl. For k>= 2, let F be a k-wise intersecting family of r-subsets of an n element set X, i.e. any k sets in F have a nonempty intersection. If r<=…

The classical Erd\H{o}s--Ko--Rado (EKR) theorem characterizes the maximum size of intersecting families of $r$-element subsets of an $n$-element set. We study EKR-type questions for independent $r$-sets in \emph{pendant} graph…

Let S(n) be the symmetric group on n points. A subset S of S(n) is intersecting if for any pair of permutations \pi, \sigma in S there is a point i in {1,...,n} such that \pi(i)=\sigma(i). Deza and Frankl \cite{MR0439648} proved that if S a…

In this paper we consider the derangement graph for the group $\textrm{PSU}(3,q)$ where $q$ is a prime power. We calculate all eigenvalues for this derangement graph and use these eigenvalues to prove that $\textrm{PSU}(3,q)$ has the…

In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This is a version of the famous Erd\H{o}s-Ko-Rado theorem for…

Let G=PGL(2,q) be the projective general linear group acting on the projective line P_q. A subset S of G is intersecting if for any pair of permutations \pi,\sigma in S, there is a projective point p in P_q such that p^\pi=p^\sigma. We…

The celebrated {Erd\H{o}s-Ko-Rado} Theorem states that for $n \geq 2k$ a family $\mathscr{F}$ of $k$ subsets of $[n]$ for which each pair of members of $\mathscr{F}$ have a non-empty intersection has size at most $\binom{n-1}{k-1}$ and for…

Let ${\mathscr L}=(X,\preceq)$ be a lattice. For ${\cal P}\subseteq X$ we say that ${\cal P}$ is $t$-{\it intersecting} if ${\sf rank}(x\wedge y)\ge t$ for all $x,y\in{\cal P}$. The seminal theorem of Erd\H{o}s, Ko and Rado describes the…

The celebrated Erd\H{o}s-Ko-Rado (EKR) theorem for Paley graphs (of square order) states that all maximum cliques are canonical in the sense that each maximum clique arises from the subfield construction. Recently, Asgarli and Yip extended…

A recent framework for generalizing the Erdos-Ko-Rado Theorem, due to Holroyd, Spencer, and Talbot, defines the Erdos-Ko-Rado property for a graph in terms of the graph's independent sets. Since the family of all independent sets of a graph…

A subset $S$ of a transitive permutation group $G \leq \mathrm{Sym}(n)$ is said to be an intersecting set if, for every $g_{1},g_{2}\in S$, there is an $i \in [n]$ such that $g_{1}(i)=g_{2}(i)$. The stabilizer of a point in $[n]$ and its…

A family of sets is intersecting if any two sets in the family intersect. Given a graph $G$ and an integer $r\geq 1$, let $\mathcal{I}^{(r)}(G)$ denote the family of independent sets of size $r$ of $G$. For a vertex $v$ of $G$, let…

In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is…

Let $ k, m, n $ be positive integers with $ k \geq 2 $. A $ k $-multiset of $ [n]_m $ is a collection of $ k $ integers from the set $ \{1, 2, \ldots, n\} $ in which the integers can appear more than once but at most $ m $ times. A family…

Let $M_k$ be a $2n$-vertex graph with $n$ pairwise disjoint edges and let $\mathcal{H}^{(p,s)}(n)$ be the family of subsets of $V(M_n)$ that span exactly $p$ edges and $s$ isolated vertices. We prove that for $n\ge 2p+s$ this family has the…