Isomorphism for random k-uniform hypergraphs

Debsoumya Chakraborti, Alan Frieze, Simi Haber, Mihir Hasabnis

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph Hn,p;k, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs Hn,r;k,r=O(1).

Original languageEnglish
Article number106039
JournalInformation Processing Letters
StatePublished - Feb 2021

Bibliographical note

Publisher Copyright:
© 2020 The Author(s)


  • Analysis of algorithms
  • Isomorphism
  • Random hypergraph


Dive into the research topics of 'Isomorphism for random k-uniform hypergraphs'. Together they form a unique fingerprint.

Cite this