# ISU Discrete Math Seminar

### Archive

Back to Spring 2022#### Fall 2021

**September 2**Chris Cox (Iowa State University)

**A toadally ribbeting and unfrogettable tale of longest common subsequences**

**September 9**Bryan Curtis (Iowa State University)

**Sign Patterns of Row Orthogonal Matrices**

**September 30**Ting-Wei Chao (Carnegie Mellon University)

**Finite Field Kakeya Problem**

**October 14**József Balogh (University of Illinois Urbana–Champaign)

**Improved upper bounds on the size of Sidon sets**

**October 21**Boris Bukh (Carnegie Mellon University)

**Extremal graphs without exponentially-small bicliques**

**November 29**Zhanar Berikkyzy (Fairfield University)

**Long cycles in Balanced Tripartite Graphs**

**December 2**Daniel McGinnis (Iowa State University)

**Ehrhart theory of paving and panhandle matroid polytopes**

#### Spring 2021

**February 4**Chris Cox (Iowa State University)

**The maximum number of paths and cycles in planar graphs**

**March 4**Jüergen Kritschgau (Iowa State University)

**Rainbow problems on groups and graphs (PhD Defense)**

**March 11**Dan Cranston (Virginia Commonwealth University)

**In Most 6-regular Toroidal Graphs All 5-colorings are Kempe Equivalent**

**March 25**Kate Lorenzen (Iowa State University)

**Cospectral constructions and spectral properties of variations of the distance matrix (PhD Defense)**

**April 1**Lauren Keough (Grand Valley State University)

**Distinguishing colorings and determining sets for Mycielskian graphs**

**April 15**Allison Beemer (University of Wisconsin–Eau Claire)

**When cut-sets don't cut it: bounds on adversarial network capacity**

**April 29**József Balogh (University of Illinois Urbana–Champaign)

**On Robustness of The Erdős–Ko–Rado Theorem**