Mihir Hasabnis

activity

20192021

most citedColorful Hamilton cycles in random graphs

2 citations · 6 across the 5 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 1 cited

The threshold for the full perfect matching color profile in a random coloring of random graphs

Debsoumya Chakraborti, Mihir Hasabnis

Consider a graph $G$ with a coloring of its edge set $E (G)$ from a set $Q = {c_{1}, c_{2}, \dots, c_{q}}$ . Let $Q_{i}$ be the set of all edges colored with $c_{i}$ . Recently, Frieze defi…

math.CO2019

The game chromatic number of a random hypergraph

Debsoumya Chakraborti, Alan Frieze, Mihir Hasabnis

We consider the following game, played on a $k$ -uniform hypergraph $H$ . There are $q$ colors available and two players take it in turns to color vertices. A partial coloring is pro…