Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Thursday, January 30, 2020 — 2:30 PM EST
Title: Random Pattern-Avoiding Permutations
Speaker: Neal Madras Affiliation: York University Room: MC 5417Abstract:
A "pattern of length k" is simply a permutation of {1,..,k}. This pattern is said to be contained in a permutation of {1,...,N} (for N>k) if there is a subsequence of k elements of the (long) permutation that appears in the same relative order as the pattern.
Thursday, January 30, 2020 — 4:00 PM EST
Title: Excluding a ladder
Speaker: Paul Wollan Affiliation: Sapienza Università di Roma Room: MC 5479Abstract:
A folklore result says that if a graph does not contain the path of length k as a subgraph, then it has tree-depth at most k.