Dhruv Rohatgi

activity

20182026

most citedConditional Hardness of Earth Mover Distance

13 citations · 21 across the 13 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2020

Regarding two conjectures on clique and biclique partitions

Dhruv Rohatgi, John C. Urschel, Jake Wellens

For a graph $G$ , let $c p (G)$ denote the minimum number of cliques of $G$ needed to cover the edges of $G$ exactly once. Similarly, let $b p_{k} (G)$ denote the minimum number of bicliq…

math.CO2018

Off-diagonal ordered Ramsey numbers of matchings

Dhruv Rohatgi

For ordered graphs $G$ and $H$ , the ordered Ramsey number $r_{<} (G, H)$ is the smallest $n$ such that every red/blue edge coloring of the complete graph on vertices ${1, \dots, n}$ co…