A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Edge lower bounds for list critical graphs, via discharging
2017
Combinatorica
The problem of bounding (from below) the number of edges in a k-critical graph has been widely studied, starting with work of Gallai and culminating with the seminal results of Kostochka and Yancey, who essentially solved the problem. In this paper, we improve the best lower bound on the number of edges in a k-list-critical graph. Our proof uses the discharging method, which makes it simpler and more modular than previous work in this area.
doi:10.1007/s00493-016-3584-6
fatcat:v5ihcsy7abferjuqmeoifd4jxu