Abhishek Dhawan

activity

20232026

most citedPalette Sparsification for Graphs with Sparse Neighborhoods

1 citations · 3 across the 19 of their papers we have counts for

collaborators

Showing 2025Show all

5 papers · 1 filter

math.CO2025

Choosability of multipartite hypergraphs

Peter Bradshaw, Abhishek Dhawan, Nhi Dinh +2

A $k$ -uniform hypergraph (or $k$ -graph) $H = (V, E)$ is $k$ -partite if $V$ can be partitioned into $k$ sets $V_{1}, \dots, V_{k}$ such that each edge in $E$ contains precisely one ver…

math.CO2025

Independent sets and colorings of $K_{t, t, t}$ -free graphs

Abhishek Dhawan, Oliver Janzer, Abhishek Methuku

Alon, Krivelevich, and Sudakov conjectured in 1999 that every $F$ -free graph of maximum degree at most $Δ$ has chromatic number $O (Δ/ lo g Δ)$ . This was previously known only for a…

cs.DS2025

Sharp Online Hardness for Large Balanced Independent Sets

Abhishek Dhawan, Eren C. Kızıldağ, Neeladri Maitra

We study the algorithmic problem of finding large $γ$ -balanced independent sets in dense random bipartite graphs; an independent set is $γ$ -balanced if a $γ$ proportion of its vert…

math.CO2025

Toward Vu's conjecture

Peter Bradshaw, Abhishek Dhawan, Abhishek Methuku +1

In 2002, Vu conjectured that graphs of maximum degree $Δ$ and maximum codegree at most $ζ Δ$ have chromatic number at most $(ζ + o (1)) Δ$ . Despite its importance, the conjecture has re…

math.CO2025

Balanced colorings of Erdős-Rényi hypergraphs

Abhishek Dhawan, Yuzhou Wang

An $r$ -uniform hypergraph $H = (V, E)$ is $r$ -partite if there exists a partition of the vertex set into $r$ parts such that each edge contains exactly one vertex from each part. W…

Choosability of multipartite hypergraphs

Independent sets and colorings of Kt,t,t​-free graphs

Sharp Online Hardness for Large Balanced Independent Sets

Toward Vu's conjecture

Balanced colorings of Erdős-Rényi hypergraphs

Independent sets and colorings of $K_{t, t, t}$ -free graphs