10 papers
The DP Color Function of Bipartite Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma +1
DP-coloring (or correspondence coloring) is a generalization of list coloring that has been widely studied since its introduction by DvoÅák and Postle in 2015. As the analogue of…
The unlabeled list color function of disconnected graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Armin Straub
Given a graph , its chromatic polynomial counts proper -colorings, while the corresponding list color function counts the minimum number of prope…
A Spectral Turán Problem for a Fixed Tree
Dheer Noal Desai, Hemanshu Kaul, Bahareh Kudarzi
We study the spectral Turán problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $…
On strongly and robustly critical graphs
Anton Bernshteyn, Hemanshu Kaul, Jeffrey A. Mudrock +1
In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list-critical graphs occupy a promin…
Counting List Colorings of Unlabeled Graphs
Hemanshu Kaul, Jeffrey A. Mudrock
The classic enumerative functions for counting colorings of a graph , such as the chromatic polynomial , do so under the assumption that the given graph is labeled. In 1…
List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
Hemanshu Kaul, Leonardo Marciaga, Jeffrey A. Mudrock
We study the list chromatic number of the Cartesian product of a complete graph of order and a complete bipartite graph with partite sets of size and , denoted $Ï_{\ell…