Speaker: Stephanie van Willigenburg, University of British Colombia Title: The (3+1)-Free Conjecture of Chromatic Symmetric Functions Abstract: The chromatic symmetric function, dating from 1995, is a...
Speaker: Anton Bernshteyn, Georgia Institute of Technology Title: Weak Degeneracy of Graphs Abstract: Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter...
Speaker: Kevin Milans, West Virginia University Title: Ordered Turan Numbers Abstract: An ordered hypergraph $G$ is a hypergraph whose vertices are linearly ordered. The ordered Turan Number of an $r$...
Speaker: Logan Crew, University of Waterloo Title: The Chromatic Symmetric Function: A Refinement of the Chromatic Polynomial Abstract: The chromatic symmetric function X_G, introduced by Richard...
Speaker: Marcus Schaefer, DePaul University Title: The Degenerate Crossing Number and Higher-Genus Embeddings Abstract: Can we quantify how much topology a graph embedded in a surface needs to use? On...
Speaker: Jeff Mudrock, College of Lake County Title: On Chromatic Polynomials, List Color Functions, and DP Color Functions Abstract: Can we quantify how much topology a graph embedded in a surface...
Speaker: Iyad Kanj, DePaul University Title: Covering Segments with Unit Intervals Abstract: In this talk, we will discuss the problem of covering a set of segments on a line with the minimum number...
Speaker: Amin Bahmanian, Illinois State University Title: Extending Colorings of Triples Using Fewest Number of Color Abstract: Suppose that $X\subseteq Y$ and $|Y|\equiv 0 \Mod 3$. When can we extend...
Speaker: Miles Bakenhus, Ph.D. candidate, Illinois Institute of Technology Title: Conditional Independence Models for Random Graphs Abstract: Conditional independence models are used across a variety...
Speaker: Sara Jamshidi Zelenberg Illinois Tech Description: Work by Tversky and others in psychology have shown that humans utilize a number of cognitive biases and heuristics to simplify their...
