Isomorphism for Random $k$-Uniform Hypergraphs
Combinatorics
2021-03-11 v3
Abstract
We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random -uniform hypergraph , for a wide range of . We also show that it is solvable w.h.p. for random -regular, -uniform hypergraphs .
Cite
@article{arxiv.2002.06953,
title = {Isomorphism for Random $k$-Uniform Hypergraphs},
author = {Debsoumya Chakraborti and Alan Frieze and Simi Haber and Mihir Hasabnis},
journal= {arXiv preprint arXiv:2002.06953},
year = {2021}
}
Comments
fixed typos and added explanations