Speaker: Minjung Michelle Kang, Ph.D. candidate, Illinois Institute of Technology Title: The Saturation Spectrum of Odd Cycles Abstract: Given a cycle \(_k\) on \(k\) vertices, we say that a graph \(G...
Speaker: Himanshu Gupta, PIMS postdoctoral fellow of mathematics and statistics, University of Regina Title: On the Rigenvalues of the Graphs \(D(5, q)\) Abstract: In 1995, Lazebnik and Ustimenko...
Speaker: Sophie Spirkl , associate professor of combinatorics and optimization, University of Waterloo Title: Treewidth and Complete Bipartite Induced Minors Abstract: I will talk about treewidth...
Speaker: Jingwei Xu, Ph.D. mathematics candidate, University of Illinois Urbana-Champaign Title: A Lower Bound on the Number of Edges in DP-Critical Graphs Abstract: A graph \(G\) is \(k\)-critical...
Speaker: Jeffrey Mudrock, University of South Alabama Title: Counting Packings of List Colorings of Graphs Abstract: List packing is a relatively new notion that was first suggested by Alon, Fellows...
Speaker: Douglas B. West, Zhejiang Normal University and University of Illinois Title: Sharp lower bounds for the number of maximum matchings in bipartite multigraphs Abstract: We study the minimum...
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...
