Tuesday, June 21, 2016 3:30 pm
-
4:00 pm
EDT (GMT -04:00)
Title: Intersecting Families of Perfect Matchings
| Speaker: | Nathan Lindzey |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
A
family
of
perfect
matchings
of
a
complete
graph
is
t-intersecting
if
any
two
of
its
members
have
t
edges
in
common.
It
has
been
conjectured
that
such
a
family
cannot
have
size
larger
than
(2(n-t)-1)!!
for
sufficiently
large
n,
and
that
the
extremal
families
are
precisely
those
comprised
of
every
perfect
matching
containing
a
fixed
set
of
t
disjoint
edges.
We
discuss
a
proof
of
this
conjecture,
emphasizing
the
algebraic
aspects
and
techniques
surrounding
the
proof.