James Anderson

activity

20212024

most citedColoring graphs with forbidden bipartite subgraphs

4 citations · 6 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024★ 1 cited

Coloring locally sparse graphs

James Anderson, Abhishek Dhawan, Aiya Kuchukova

A graph $G$ is $k$ -locally sparse if for each vertex $v \in V (G)$ , the subgraph induced by its neighborhood contains at most $k$ edges. Alon, Krivelevich, and Sudakov showed that f…

math.CO2022

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 $F$ , there exists a quantity $c (F)$ such that $χ (G) \leq (c (F) + o (1)) Δ/ lo g Δ$ whenever $G$ is an $…

math.CO2021★ 4 cited

Coloring graphs with forbidden bipartite subgraphs

James Anderson, Anton Bernshteyn, Abhishek Dhawan

A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph $F$ , there is a constant $c_{F} > 0$ such that if $G$ is an $F$ -free graph of maximum degree $Δ$ , then $χ(G)…