|
|
A338279
|
|
Number of 3-uniform 2-regular hypergraphs on 3n unlabeled nodes.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A 2-regular 3-uniform hypergraph on v vertices can exist only if v is a multiple of 3. The initial terms were generated by using the nauty function in SageMath.
|
|
LINKS
|
|
|
PROG
|
(Sage) Set(list(hypergraphs.nauty(#edges, #vertices, uniform=3, regular=2))).cardinality()
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|