# Events

Thursday, January 30, 2020 — 2:30 PM EST

## Algebraic Combinatorics Seminar - Neal Madras

Title: Random Pattern-Avoiding Permutations

 Speaker: Neal Madras Affiliation: York University Room: MC 5417

Abstract:

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

## Graphs and Matroids Seminar - Paul Wollan

 Speaker: Paul Wollan Affiliation: Sapienza Università di Roma Room: MC 5479

Abstract:

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.

Friday, January 31, 2020 — 1:00 PM EST

## Combinatorial Optimization Reading Group - Hong Zhou

Title: Network Design $s$-$t$ Effective Resistance

 Speaker: Hong Zhou Affiliation: University of Waterloo Room: MC 5417

Abstract:

We consider a problem of designing a network with small $s$-$t$ effective resistance. In the problem, we are given an undirected graph $G=(V,E)$, two designated vertices $s,t \in V$, and a budget $k$.

### January 2020

S M T W T F S
29
30
31
1
2
3
4
5
6
7
8
11
12
13
14
15
18
19
20
21
22
25
26
27
28
29
1
1. 2020 (11)
1. January (11)
2. 2019 (167)
1. December (5)
2. November (15)
3. October (18)
4. September (15)
5. August (9)
6. July (17)
7. June (18)
8. May (16)
9. April (9)
10. March (24)
11. February (13)
12. January (8)
3. 2018 (138)
4. 2017 (103)
5. 2016 (137)
6. 2015 (136)
7. 2014 (88)
8. 2013 (48)
9. 2012 (39)
10. 2011 (36)
11. 2010 (40)
12. 2009 (40)
13. 2008 (39)
14. 2007 (15)