ULethbridge - Number Theory and Combinatorics Seminar: Mahsa N. Shirazi | PIMS - Pacific Institute for the Mathematical Sciences

Topic

On a Generalization of the Erd\H{o}s-Ko-Rado Theorem to Intersecting and Set-wise Intersecting Perfect Matchings

A perfect matching (

P M

) in the complete graph

K_{2 k}

is a set of edges by which every vertex is covered exactly once. Two

P M

s are said to be

t

-intersecting if they have at least

t

edges in common. Another type pf intersection that we can define on

P M

s is set-wise intersection. Two

P M

P

and

Q

of a graph on

2 k

vertices are said to be set-wise

t

-intersecting if there exist edges

P_{1}, \dots, P_{t}

P

and

Q_{1}, \dots, Q_{t}

Q

such that the union of edges

P_{1}, \dots, P_{t}

has the same set of vertices as the union of

Q_{1}, \dots, Q_{t}

. In this talk we show an extension of the famous Erd\H{o}s-Ko-Rado theorem to intersecting and set-wise intersecting

P M

for

t = 2

and

t = 3

This talk is held in-person and online.

Time: 1:30pm Pacific / 2:30pm MT

Location: SA6006

Mahsa N. Shirazi, URegina

This is a Past Event

Event Type

Scientific, Seminar

Date

November 24, 2021

Time

2:30pm - 4:30pm

Location

University of Lethbridge