Abhishek Dhawan

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The low-degree hardness of finding large independent sets in sparse random hypergraphs SIAM Journal on Discrete Mathematics	2026-04-01	Paper
Coloring locally sparse graphs The Electronic Journal of Combinatorics	2026-03-20	Paper
Borel Vizing's theorem for graphs of subexponential growth Proceedings of the American Mathematical Society	2024-12-18	Paper
Edge-coloring algorithms for bounded degree multigraphs	2024-11-28	Paper
Balanced independent sets and colorings of hypergraphs	2023-11-03	Paper
Multigraph edge-coloring with local list sizes	2023-07-22	Paper
Edge-Coloring Algorithms for Bounded Degree Multigraphs	2023-07-13	Paper
Borel Vizing's Theorem for Graphs of Subexponential Growth	2023-06-30	Paper
Coloring graphs with forbidden almost bipartite subgraphs	2022-03-14	Paper
Coloring graphs with forbidden bipartite subgraphs (available as arXiv preprint)	2021-07-12	Paper
Fast algorithms for Vizing's theorem on bounded degree graphs (available as arXiv preprint)	N/A	Paper
List colorings of $k$-partite $k$-graphs (available as arXiv preprint)	N/A	Paper
Coloring locally sparse graphs (available as arXiv preprint)	N/A	Paper
Bounds for the independence and chromatic numbers of locally sparse graphs (available as arXiv preprint)	N/A	Paper
The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Abhishek Dhawan