Speaker: Peter Bradshaw, University of Illinois Urbana-Champaign Title: Flexible List Coloring and Maximum Average Degree Abstract: The flexible list coloring problem is a problem whose input is a...
Speaker: Evelyne Smith-Roberge, Georgia Tech Title: Counting Correspondence Colourings of Embedded Graphs Abstract: Langhede and Thomassen conjectured in 2020 that there exists a positive constant c...
Speaker: Stjin Cambie, Katholieke Universiteit at Leuven, Belgium Title: The Average Solution of a TSP Instance in a Graph Abstract: In many practical situations (mostly logistics- or routing-related)...
Speaker: Bahareh Kudarzi, Illinois Institute of Technology Title: An Improved Algorithm for Finding Maximum Outerplanar Subgraphs Abstract: We study the NP-complete problem of Maximum Outerplanar...
Speaker: Samantha Dahlberg, postdoctoral scientist, Illinois Institute of Technology Title: Algebraic Techniques on the DP Color Function Abstract: DP-coloring (or correspondence coloring) is a...
Speaker: Dan Cranston, associate professor of computer science, Virginia Commonwealth University Title: Cliques in Squares of Graphs with Maximum Average Degree Less Than 4 Abstract: Hocquard, Kim...
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...
