THIS SITE

Information for

Events

Friday, July 29, 2016 — 3:30 PM EDT

Title: The chance-constrained vehicle routing problem

Speaker: Ricardo Fukasawa
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

Tuesday, July 26, 2016 — 3:30 PM EDT

Title: Fast quantum search with continuous quantum walk on graphs

Tuesday, July 26, 2016 — 2:30 PM to 3:20 PM EDT

Title: Structured Bilinear Mixed-Integer Programming

Speaker: Billy Jin
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Friday, July 22, 2016 — 3:30 PM EDT

Title: Matchings in tripartite hypergraphs

Tuesday, July 19, 2016 — 3:30 PM EDT

Title: Vertex-primitive digraphs having vertices with almost equal
neighbourhoods

Speaker: Gabriel Verret
Affiliation: University of Auckland
Room: MC 6486

Abstract:

Thursday, July 14, 2016 — 3:30 PM EDT

Title: On linearly dense minor-closed classes of matroids

Wednesday, July 13, 2016 — 4:00 PM EDT

Title: Induced subgraphs of graphs with large chromatic number

Speaker: Alex Scott
Affiliation: University of Oxford
Room: MC 6486

Abstract: What can we say about the induced subgraphs of a graph G with very large chromatic number? 

Tuesday, July 12, 2016 — 3:30 PM to 5:00 PM EDT

Title: Discovery of the Trellis

Speaker: Nishad Kothari
Affiliation: Combinatorics & Optimization, University of Waterloo
Room: MC 5501

Abstract:

A brick is a 3-connected graph with the additional property that deleting any two vertices results in a graph which has a perfect matching. Bricks play a central role in matching theory.

Tuesday, July 12, 2016 — 2:30 PM EDT

Title: A post-quantum cryptosystem from supersingular
elliptic curve isogenies

Thursday, July 7, 2016 — 3:30 PM to 4:30 PM EDT

Title: On Grötzsch's Theorem

Speaker: Daniel H. Younger
Affiliation: University of Waterloo
Room: DC 1302

*Please note this event will be filmed

Thursday, July 7, 2016 (all day) to Friday, July 8, 2016 (all day)

The main focus of the conference, to be held at the University of Waterloo, will be on Flows and MinMax equalities.

There have been recent exciting advances towards Tutte's famous 3-, 4-, and 5-flow conjectures. Extending Thomassen's breakthrough work, it is now known that the 3-flow conjecture (actually Jaeger's strengthening of it) holds for 6-edge-connected graphs. The entire conjecture would follow if the 6 could be replaced by 5.

Tuesday, July 5, 2016 — 3:30 PM EDT

Title: Mutually Orthogonal Latin Squares with Large Holes

Speaker: Christopher van Bommel
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Tuesday, July 5, 2016 — 2:30 PM to 3:20 PM EDT

Title: Counting Maps via Character Theory

Speaker: Trevor Gunn
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Monday, July 4, 2016 — 3:30 PM to 5:00 PM EDT

Title: Recognition Problems for Connectivity Functions

S M T W T F S
26
27
28
29
30
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
3
4
5
6
  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)