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...
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...
Host Department of Applied Mathematics Speaker Benjamin Reiniger, Visiting Assistant Professor Department of Applied Mathematics, Illinois Institute of Technology http://math.iit.edu/~breiniger/...
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
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...
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)...
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...
Host Department of Applied Mathematics Speaker Andrew H. Suk, Assistant Professor, Department of Mathematics, Statistics, and Computer Science University of Illinois at µç³µÎÞÂë http://homepages.math...
Host Hemanshu Kaul Description Jinyu will give a talk about his work on algorithmic problems in Matroids, a mathematical structure that generalizes the notion of independence in vector spaces and in...
Host Applied Mathematics Description Matroids are a mathematical structure that generalize the linear independence in vector spaces and acyclic subgraphs in graphs, and have been applied in...
