On Mon, Oct 15, 2018 at 3:57 PM Jakub Sliacan <[email protected]> wrote: > 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!
graphs/hypergraph_generators.py is there since 2013. What you propose is a reasonable feature - is it documented in nauty manual? If not, it's probably not meant to be exposed to the user. So one could ask Brendan Mckay to add it. There is also an almost done ticket porting pynauty to Sage, https://trac.sagemath.org/ticket/25506 where the interface is via C/C++, which should make getting directly into nauty's guts much easier. Please feel free to open a Sage ticket on this. Dima -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
