done, please review
On Sun, Jun 7, 2020 at 7:41 PM Dima Pasechnik wrote:
>
> will be fixed on https://trac.sagemath.org/ticket/29821
>
> On Sun, Jun 7, 2020 at 3:01 PM slelievre wrote:
> >
> > Le samedi 6 juin 2020 22:53:13 UTC+2, Dima Pasechnik a écrit :
> > >
> > > The code in question calls n
will be fixed on https://trac.sagemath.org/ticket/29821
On Sun, Jun 7, 2020 at 3:01 PM slelievre wrote:
>
> Le samedi 6 juin 2020 22:53:13 UTC+2, Dima Pasechnik a écrit :
> >
> > The code in question calls nauty's genbg program, and hypergraphs are
> > encoded as vertex-(hyper)edge incidence grap
Le samedi 6 juin 2020 22:53:13 UTC+2, Dima Pasechnik a écrit :
>
> The code in question calls nauty's genbg program, and hypergraphs are
> encoded as vertex-(hyper)edge incidence graphs. It seem that one needs
> to read its source code (e.g. here:
> https://github.com/lonnen/nauty/blob/nauty27/g
The code in question calls nauty's genbg program, and hypergraphs are
encoded as vertex-(hyper)edge incidence graphs. It seem that one needs
to read its source code (e.g. here:
https://github.com/lonnen/nauty/blob/nauty27/genbg.c)
to understand how the limits are controlled, there are parameters
ca
As I discovered on CoCalc running Sage 9.1, it appears that any attempt to
use nauty/genbg to build bipartite/hyper-/di- graphs with more than 32
total vertices fails silently.
Please compare the results of:
-
L=list(hypergraphs.nauty(13, 13, uniform=2, regular=2,max_intersection=1))
for
As I discovered on CoCalc running Sage 9.1, it appears that any attempt to
use nauty/genbg to build bipartite/hyper-/di- graphs with more than 32
total vertices fails silently.
Please compare the results of:
-
L=list(hypergraphs.nauty(13, 13, uniform=2, regular=2,max_intersection=1))
for
