1 citations · 1 across the 3 of their papers we have counts for
3 papers
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 . Despite its importance, the conjecture has re…
math.CO2025
Balanced colorings of Erdős-Rényi hypergraphs
Abhishek Dhawan, Yuzhou Wang
An -uniform hypergraph is -partite if there exists a partition of the vertex set into parts such that each edge contains exactly one vertex from each part. W…
cs.DS2023★ 1 cited
Detection of Dense Subhypergraphs by Low-Degree Polynomials
Abhishek Dhawan, Cheng Mao, Alexander S. Wein
Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem that has been extensively studied in recent years. We study a hypergr…