Hi!
I was excited to see that one can now generate some hypergraphs in sage via nauty's bipartite graph genbg function. Looking through nauty's source I saw that there's a prune routine that can be called at every stage of generation, it "just" needs to be implemented. I was wondering if there are any plans to implement an "avoider" prune function to be able to generate all hypergraphs (up to isomorphism) which avoid a given set of small hypergraphs. I am pretty sure that it would be a very popular feature, as virtually all extremal combinatorics people would find it useful! Thanks heaps, jakub -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
