2 papers
math.CO2025
Coloring locally sparse graphs
James Anderson, Abhishek Dhawan, Aiya Kuchukova
A graph is -locally sparse if for each vertex , the subgraph induced by its neighborhood contains at most edges. Alon, Krivelevich, and Sudakov showed that f…
math.CO2025
Coloring graphs with forbidden almost bipartite subgraphs
James Anderson, Anton Bernshteyn, Abhishek Dhawan
Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph , there exists a quantity such that whenever is a…