## Search

Now showing items 1-5 of 5

#### On the relationship between zero forcing number and certain graph coverings

(2014)

The zero forcing number and the positive zero forcing number of a graph are
two graph parameters that arise from two types of graph colourings. The zero
forcing number is an upper bound on the minimum number of induced ...

#### Intersecting generalized permutations

(2014-01-21)

#### An Erdos-Ko-Rado theorem for the derangement graph of PGL(2,q) acting on the projective plane

(SIAM Journal on Discrete Mathematics, 2014)

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

#### An Erdős-Ko-Rado theorem for the derangement graph of \(PGL_3(q)\) acting on the projective plane

(SIAM J. Discrete Math. 28, 2014)

In this paper we prove an Erdős-Ko-Rado-type theorem for
intersecting sets of permutations. We show that an intersecting set
of maximal size in the projective general linear group \(PGL_3(q)\),
in its natural ...

#### C.V.

(2014-01-21)