Daniel H. Younger - Directed Graph Conference
Title: On Grötzsch's Theorem
Speaker: | Daniel H. Younger |
Affiliation: | University of Waterloo |
Room: | DC 1302 |
*Please note this event will be filmed
Title: On Grötzsch's Theorem
Speaker: | Daniel H. Younger |
Affiliation: | University of Waterloo |
Room: | DC 1302 |
*Please note this event will be filmed
Title: A post-quantum cryptosystem from supersingular
elliptic curve isogenies
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.
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?
Title: On linearly dense minor-closed classes of matroids
Title: Counting Generalised Proper Colourings
Title: Vertex-primitive digraphs having vertices with almost equal
neighbourhoods
Speaker: | Gabriel Verret |
Affiliation: | University of Auckland |
Room: | MC 6486 |
Abstract:
Title: Matchings in tripartite hypergraphs
Title: Structured Bilinear Mixed-Integer Programming
Speaker: | Billy Jin |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract:
Title: Fast quantum search with continuous quantum walk on graphs