Title: On edge-transitive distance-regular antipodal covers of complete graphs
Title: Nash-Williams Orientation Conjecture for Infinite Graphs
| Speaker: | Amena Assem |
| Affiliation | University of Waterloo |
| Location: | MC 5479 |
Abstract: In 1960 Nash-Williams proved that every 2k-edge-connected finite graph admits a k-arc-connected orientation. He conjectured that this is also true for infinite graphs. We try to prove the conjecture. Joint work with Bruce Richter.
Title: Extended Formulations
Title: On Robustness of The Erdős--Ko--Rado Theorem
Title: Binary tubings and Dyson-Schwinger equations
Title: Smallest Compact Formulation for the Permutahedron
Title: Cheeger-Type Inequalities using Reweighted Eigenvalues
Title: Hitting all maximum stable sets in P5-free graphs
| Speaker: | Sepehr Hajebi |
| Institution: | University of Waterloo |
| Location: | MC 5479 |
Abstract: We prove that there exists a function f such that, for every positive integer c, every graph with no induced five-vertex path contains either a clique on c+1 vertices or a set of at most f(c) vertices which intersects all maximum stable sets in G.
Title: Quantum hooks and the Plücker coordinate mirror
Title: Extended Formulations, Part II