Timeline for Counting regular Hypergraphs
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 17, 2013 at 3:41 | review | First posts | |||
| Dec 17, 2013 at 3:50 | |||||
| Dec 10, 2013 at 20:15 | comment | added | Ira Gessel | You can consider the problem of counting hypergraphs on n vertices with specified degrees of the vertices as counting partitions of a multiset in which each block is a set. Some references for this problem can be found in my paper Symmetric Functions and P-Recursiveness, J. Combin. Theory Ser. A 53 (1990), 257–285, people.brandeis.edu/~gessel/homepage/papers/dfin.pdf | |
| Dec 10, 2013 at 16:34 | history | asked | user43928 | CC BY-SA 3.0 |