THIS SITE

Information for

Events

Thursday, March 31, 2016 — 4:00 PM EDT

Title: Presenting a tangle

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: MC 5417

Abstract: A tangle of order $k$ in a matroid is an abstract notion that describes a “$k$-connected component” of a matroid. Tangles are very useful in theoretical applications, but in practice they suffer from being difficult to describe succinctly. In this talk we try to address that issue and present some negative results.

Thursday, March 31, 2016 — 3:00 PM EDT

Title: Arc-transtive cubic graphs

Speaker: Krystal Guo
Affiliation: University of Waterloo
Room: MC 6486

Abstract: We will look at a classical result of Tutte in his seminal paper "A Family of Cubic Graphs"; every cubic arc-transitive graph is s-arc-regular for some s between 1 and 5.

Thursday, March 31, 2016 — 3:00 PM EDT

Title: Arc-transtive cubic graphs

Speaker: Krystal Guo
Affiliation: University of Waterloo
Room: MC 6486

Abstract: We will look at a classical result of Tutte in his seminal paper "A Family of Cubic Graphs"; every cubic arc-transitive graph is s-arc-regular for some s between 1 and 5.

Monday, March 21, 2016 — 4:30 PM EDT

Title: The mathematics of juggling

Speaker: Gabriel Gauthier-Shalom
Affiliation: University of Waterloo
Room: MC 6486

Abstract: Siteswap is a mathematical notation for juggling patterns that is
natural, simple, and useful in practice. I will be presenting an overview of
this topic and its connections with other areas of mathematics. There will be demonstrations!

Thursday, March 17, 2016 — 4:00 PM EDT

Title: The matroid secretary problem for minor-closed classes

Thursday, March 17, 2016 — 2:00 PM EDT

Title: McMullen's proof of the g-theorem for polytonal spheres

Friday, March 11, 2016 — 3:30 PM EST

Title: Graphs are to matroids as embedded graphs are to what?

Thursday, March 10, 2016 — 4:30 PM EST

Title: The replication conjecture II

Speaker: Ahmad Abdi
Affiliation: University of Waterloo
Room: MC 5417

Abstract: In 1993, Conforti and Cornuejols conjectured that replicating the vertex of a clutter preserves the packing property. I will present some tools that will be helpful in tackling this conjecture. The upshot is to take advantage of the fact that clutters with the packing property exclude delta minors, as well as some other small minors.

Thursday, March 10, 2016 — 3:00 PM EST

Title: Strongly regular subconstituents of strongly regular graphs

Monday, March 7, 2016 — 4:30 PM EST

Title: The perfect matching polytope and solid graphs

Friday, March 4, 2016 — 3:30 PM EST

Title: On some polytopes contained in the 0,1 hypercube that have a small
chvatal rank

Thursday, March 3, 2016 — 4:00 PM EST

Title: A unified Erd\H os-P\'osa theorem for constrained cycles

Thursday, March 3, 2016 — 3:00 PM EST

Title: Introduction to association schemes

Speaker: Krystal Guo
Affiliation: University of Waterloo
Room: MC 6486

Abstract: The theory of association schemes is an important toolbox for algebraic graph theory. We will give an introduction to association scheme, distance regular graphs and the clique-coclique bound.

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