Discrete Mathematics and Optimization - A Group Meeting

2013 Talks

Friday December 13, 2013
Creating Hamilton and Eulerian Cycles One Edge at a Time
Aaron Williams

Thursday December 5, 2013
On well-supported Nash equilibria
Adrian Vetta

Thursday, November 28, 2013
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses
Bundit Laekhanukit

Tuesday, April 9, 2013
Morphic Words and Nested Recurrence Relations
Marcel Celaya

Tuesday, March 19, 2013
Rainbow Turán Problems
Jonathan Noel

Tuesday, March 26, 2013
Sidorenko’s conjecture for a class of graphs
Liana Yepremyan

Tuesday, February 13 and 20, 2013
Title: Proof of (n/2-n/2-n/2)-Conjecture for large n
Hehui Wu

February 5 2013.
Graph connectivities, network coding, and expander graphs
Bundit Laekhanukit