Showing 2024Show all
2 papers · 1 filter
math.CO2024
Shameful Inequalities for List and DP Coloring of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma
The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was introduced by Birkhoff in 1912; denoted , it equals the number of proper -…
math.CO2024
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…