The study of intersection problems in extremal combinatorics dates back perhaps to 1938,
when Paul Erdos, Chao Ko and Richard Rado proved the (first)'Erdos-Ko-Rado theorem'on …

Given a permutation group 𝐺, the derangement graph of 𝐺 is the Cayley graph with
connection set the derangements of 𝐺. The group 𝐺 is said to be innately transitive if 𝐺 has a …

Two elements g and h of a permutation group G acting on a set V are said to be intersecting
if vg= vh for some v∈ V. More generally, a subset F of G is an intersecting set if every pair of …

Given a finite transitive permutation group $ G\leq\operatorname {Sym}(\Omega) $, with
$|\Omega|\geq 2$, the derangement graph $\Gamma_G $ of $ G $ is the Cayley graph …

Two elements g and h of a permutation group G acting on a set V are said to be intersecting
if g (v)= h (v) for some v∈ V. More generally, a subset F of G is an intersecting set if every …

In this paper, we show that both the general linear group GL (2, q) and the special linear
group SL (2, q) have both the EKR property and the EKR-module property. This is done …

Given a finite group $ G $, we say that $ G $ has weak normal covering number $\gamma_w
(G) $ if $\gamma_w (G) $ is the smallest integer with $ G $ admitting proper subgroups …

A subset F of a finite transitive group G≤ Sym (Ω) is intersecting if for any g, h∈ F there
exists ω∈ Ω such that ω g= ω h. The intersection density ρ (G) of G is the maximum of {| F|| G …

For a permutation group G acting on a set V, a subset I of G is said to be an intersecting set if
for every pair of elements g, h∈ I there exists v∈ V such that g (v)= h (v). The intersection …

A subset F of a finite transitive group G≤ Sym (Ω) is intersecting if any two elements of F
agree on an element of Ω. The intersection density of G is the number ρ (G)= max⁡{| F|/| G …