hypergraph enumeration?

[Gordon Royle]

The answer is yes, but they are not listed under "k-uniform hypergraph" 
(which IMHO they should be).

For k=3, the total number of k-uniform hypergraphs is A000665 and has 
the name "Relations with 3 arguments on n nodes" which I guess is clear 
enough, but not something that you would hit upon.

I have not yet looked for k=4, or for the division of these numbers 
into the number of each type with 0,1,2,... hyperedges, but it is 
straightforward to compute these numbers with the appropriate tools.

Cheers

gordon


On 15/03/2004, at 12:45 PM, Edwin Clark wrote:

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