Mihir Hasabnis

collaborators

3 papers

math.CO2020

Isomorphism for Random $k$ -Uniform Hypergraphs

Debsoumya Chakraborti, Alan Frieze, Simi Haber +1

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$ -uniform hypergraph $H_{n, p; k}$ , for a wide range…

math.CO2019

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…

Isomorphism for Random k-Uniform Hypergraphs

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

The game chromatic number of a random hypergraph

Isomorphism for Random $k$ -Uniform Hypergraphs