Nhi U. Dinh

collaborators

2 papers

cs.DS2026

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

Abhishek Dhawan, Nhi U. Dinh, Eren C. Kızıldağ +2

We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within e…

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…