4 citations · 6 across the 7 of their papers we have counts for
8 papers
Multigraph edge-coloring with local list sizes
Abhishek Dhawan
Let be a multigraph and be a list assignment on the edges of . Suppose additionally, for every vertex , the edges incident to have at le…
Edge-Coloring Algorithms for Bounded Degree Multigraphs
Abhishek Dhawan
In this paper, we consider algorithms for edge-coloring multigraphs of bounded maximum degree, i.e., . Shannon's theorem states that any multigraph of maximum degr…
Borel Vizing's Theorem for Graphs of Subexponential Growth
Anton Bernshteyn, Abhishek Dhawan
We show that every Borel graph of subexponential growth has a Borel proper edge-coloring with colors. We deduce this from a stronger result, namely that an -verte…
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…
Fast algorithms for Vizing's theorem on bounded degree graphs
Anton Bernshteyn, Abhishek Dhawan
Vizing's theorem states that every graph of maximum degree can be properly edge-colored using colors. The fastest currently known -edge-coloring algorithm for…
Sharp analysis of EM for learning mixtures of pairwise differences
Abhishek Dhawan, Cheng Mao, Ashwin Pananjady
We consider a symmetric mixture of linear regressions with random samples from the pairwise comparison design, which can be seen as a noisy version of a type of Euclidean distance…
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 an $…
Coloring graphs with forbidden bipartite subgraphs
James Anderson, Anton Bernshteyn, Abhishek Dhawan
A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph , there is a constant such that if is an -free graph of maximum degree , then $χ(G)…