Enumeration of hypergraphs (Q5942871): Difference between revisions

Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)] where the focus was on pure hypergraphs.

0 references

reviewed by

Edgar M. Palmer

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

MaRDI publication profile

0 references

0 references

0 references

0 references

On the number of bi-colored graphs

0 references

Q5682013

0 references

Q3880849

0 references

Enumeration of hypergraphs. I

0 references

Q3905317

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5942871

@@ Property / OpenAlex ID @@
+W1988098095
@@ Property / OpenAlex ID: W1988098095 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5553123
@@ Property / cites work: Q5553123 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of bi-colored graphs
@@ Property / cites work: On the number of bi-colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5682013
@@ Property / cites work: Q5682013 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of hypergraphs. I
@@ Property / cites work: Enumeration of hypergraphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q3905317
@@ Property / cites work: Q3905317 / rank @@
+Normal rank