Speaker: Michael Pelsmajer, associate professor of applied mathematics, Illinois Institute of Technology Title: Flexible List Coloring Abstract: Graph coloring is a fundamental concept in discrete...
Speaker: Josh Hallam, Loyola Marymount Title: Parking Functions and Noncrossing Partitions of Graphs Abstract: Imagine you have a row of parking spots labeled 1 through n on a one-way street. Moreover...
Speaker: Daniel Dominik, Illinois Institute of Technology Title: DP-Coloring of Graphs from Random Covers Abstract: DP-coloring (also called correspondence coloring) of graphs is a generalization of...
Speaker: Bridget Tenner, DePaul University Title: Pattern Functions Abstract: Permutations are a classic tool for representing mathematical scenarios. The study of permutations in their own right, as...
Speaker: Michael Pelsmajer, Illinois Institute of Technology Title: The Strong Hanani-Tutte Theorem for Radial Planarity Abstract: Graph drawing considers various ways to represent a network visually...
Speaker: Michael Tait, Villanova University Title: Subgraphs of Pseudo-Random Graphs Abstract: Fix a graph \(F\). If I have a large pseudo-random graph can I always find \(F\) as a subgraph? Can I...
Speaker: James Davies, University of Cambridge, UK Title: Odd Distances in Colourings of the Plane. Abstract: We prove that every finite colouring of the plane contains a monochromatic pair of points...
Speaker: Bruce Sagan, Michigan State University Title: Chromatic Symmetric Functions, P-tableaux, and Jacobi-Trudi Determinants Abstract: For a graph G, let X(G) be Stanley’s chromatic symmetric...
Speaker: Gunjan Sharma, Illinois Institute of Technology Title: Almost-Perfect Matchings in Trees Abstract: The Hosoya index of a graph is the total number of matchings in it and is a long-studied...
Speaker: Ruth Luo, University of South Carolina Title: Minimum Degree Conditions Ensuring the Existence of Long Cycles in Hypergraphs Abstract: Dirac proved that every \(n\)-vertex graph with minimum...
