A. Dhawan

activity

20212023

most citedColoring graphs with forbidden bipartite subgraphs

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

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2023

Multigraph edge-coloring with local list sizes

Abhishek Dhawan

Let $G$ be a multigraph and $L : E (G) \to 2^{N}$ be a list assignment on the edges of $G$ . Suppose additionally, for every vertex $x$ , the edges incident to $x$ have at le…

math.CO2023

Borel Vizing's Theorem for Graphs of Subexponential Growth

Anton Bernshteyn, Abhishek Dhawan

We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $Δ (G) + 1$ colors. We deduce this from a stronger result, namely that an $n$ -verte…

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)…