Speaker: Dan Dominik, Illinois Institute of Technology Title: Fractional DP-coloring of Graphs Abstract: Fractional coloring is linear programming relaxation of classic coloring of graphs where...
Speaker: Zimu Xiang, University of Illinois Urbana-Champaign Title: Equitable List Coloring of Sparse Graphs Abstract: A proper vertex coloring of a graph is equitable if the sizes of all color...
Speaker: Gunjan Sharma, Illinois Institute of Technology Title: "Shameful" and Related Inequalities for List and DP Colorings of Graphs Abstract: For an n-vertex graph G, we define the mean color...
Speaker: Ian Gossett, Wesleyan University Title: Some Orientation Theorems for Restricted DP-colorings of Graphs Abstract: DP-colorings of graphs (originally called correspondence colorings) are a...
Speaker: Joe Jackson (U of C). Title: The Convergence Problem in Mean Field Control. Abstract: This talk will be about the convergence problem in mean field control (MFC), i.e. the challenge of...
Speaker: Kathryn Nyman, professor of mathematics, Willamette University Title: Vote Freely: A Look at Kemeny and Borda on Relations Abstract: The Kemeny rule has a natural interpretation in terms of...
Speaker: Foster Tom, postdoctoral instructor, Massachusetts Institute of Technology Title: A Signed E-expansion of the Chromatic Symmetric Function and Some New E-positive Graphs Abstract: We prove a...
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)...
