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

5 papers

math.CO2021★ 2 cited

Colorful Hamilton cycles in random graphs

Debsoumya Chakraborti, Alan Frieze, Mihir Hasabnis

Given an $n$ vertex graph whose edges have colored from one of $r$ colors $C = {c_{1}, c_{2}, \dots, c_{r}}$ , we define the Hamilton cycle color profile $h c p (G)$ to be the set of vectors $…

math.CO2020★ 2 cited

Minimizing the number of edges in $K_{s, t}$ -saturated bipartite graphs

Debsoumya Chakraborti, Da Qi Chen, Mihir Hasabnis

This paper considers an edge minimization problem in saturated bipartite graphs. An $n$ by $n$ bipartite graph $G$ is $H$ -saturated if $G$ does not contain a subgraph isomorphic to…

math.CO2020★ 1 cited

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★ 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