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 2020Show all

2 papers · 1 filter

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…

Minimizing the number of edges in Ks,t​-saturated bipartite graphs

Isomorphism for Random k-Uniform Hypergraphs

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

Isomorphism for Random $k$ -Uniform Hypergraphs