Apr
7
On Total Equitable Choosability
Host Department of Applied Mathematics Description This talk will be accessible to those with knowledge of basic graph theory. The concept of equitable coloring was formally introduced by Meyer in...
Events Archive
Find an Event
Currently selected filters
- Discrete Applied Math Seminar
Mar
3
The List Color Function and Chromatic Choosability
Host Department of Applied Mathematics Speaker Jeffrey Mudrock Department of Applied Mathematics, Illinois Institute of Technology http://jmudrock.weebly.com/ Description This talk will be accessible...
Feb
15
Quickly Catching a Robber in a Graph
Host Department of Applied Mathematics Speaker Benjamin Reiniger Department of Applied Mathematics, Illinois Institute of Technology http://math.iit.edu/~breiniger/ Description The game of Cops and...
Feb
10
The Maximum Number of Cliques in Graphs without Long Cycles
Host Department of Applied Mathematics Speaker Ruth Luo Department of Mathematics, University of Illinois at Urbana-Champaign http://math.illinois.edu/~ruthluo2/ Description The Erdős-Gallai Theorem...
Nov
4
Geometric Distance-Regular Graphs
Host Department of Applied Mathematics Description A non-complete distance-regular graph \(\Gamma\) is called geometric if there exists a set of Delsarte cliques \(\mathcal{C}\) such that each edge of...
Sep
16
Coloring, Sparseness and Girth
Host Department of Applied Mathematics Speaker Benjamin Reiniger, Visiting Assistant Professor Department of Applied Mathematics, Illinois Institute of Technology http://math.iit.edu/~breiniger/...
Jul
8
Chris Mitillos Ph.D. Thesis Defense
Topics in Graph Fall-Coloring Host Department of Applied Mathematics Description PhD thesis defense on "Topics in Graph Fall-Coloring" Event Topic Discrete Applied Math Seminar Graduate Student Other
Apr
19
Introduction to Minimum Cost Flow and the Network Simplex Algorithm
Host Department of Applied Mathematics Description The minimum cost network flow (MCNF) problem is an important form of linear program that can be used to model a wide variety of network design and...
Feb
24
Limiting Theorems for the Optimal Alignments Score in Multiple Random Words
Host Department of Applied Mathematics Speaker Ruoting Gong, Assistant Professor Department of Applied Mathematics, Illinois Institute of Technology Description Let X n (1),..., X n (m), where X n (i)...
Feb
19
On the List Chromatic Number of the Cartesian Product with a Traceable Graph: Using the Alon-Tarsi Method
Host Department of Applied Mathematics Description The concept of list coloring was introduced independently by Erdős and Vizing in the 1970s. It is a natural generalization of graph coloring with...