Skip to content

Author

Abhishek Dhawan

We have 3 of 30 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Random independent sets in uncrowded hypergraphs

Given any fixed integer $k \ge 2$ and sufficiently large $d$, we show that the largest possible fractional chromatic number of a $k$-uniform $d$-degenerate uncrowded hypergraph $H$ (i.e., with girth at least $5$) satisfies \[ \chi_f(H) = (1 + o_d(1)) \left((k-1)\,\frac{d}{\log d}\right)^{\frac{1}{k-1}}. \] In fact, we...

Abhishek Dhawan, Li-Na Li, Abhishek Methuku et al. · 0 citations
Preprint Sep 2026

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, a...

Abhishek Dhawan, Huy Nguyen, R. Rathi · 0 citations
Jul 2026

Sharp bounds for the fractional chromatic number of high-girth d-degenerate graphs

Martinsson and Steiner recently proved that the fractional chromatic number of any $d$-degenerate triangle-free graph $G$ satisfies $\chi_f(G) = O\left(\frac{d}{\log d}\right)$. They further conjectured a sharp leading constant $1 + o(1)$. In this paper, we confirm their upper bound conjecture for graphs having girth a...

Peter Allen, Abhishek Dhawan, Jonathan A. Noel · 3 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.