hypergraph enumeration?

Edwin Clark eclark at math.usf.edu
Mon Mar 15 05:45:03 CET 2004

Has anyone enumerated k-uniform hypergraphs with m edges on n 
vertices (up to isomorphism) for small values of k, m and n.
For k = 2, I know it has been done, since these are ordinary graphs, but 
what about for k > 2. Say for k = 3, m = 3,4 or 5. I cannot find anything in 
the OEIS. 

Maybe I'm not looking for the right words?

--Edwin Clark

More information about the SeqFan mailing list