Very final
iteration: https://34.105.185.241/sagemath/sage-prod-2023-01-30-077/issues
(with the final data from the read-only Trac)
On Monday, January 30, 2023 at 10:49:17 AM UTC-8 Matthias Koeppe wrote:
> (Final + 2)nd iteration:
> https://34.105.185.241/sagemath/sage-all-2023-01-14-016
>
>
I think it can be done in the same code that provides the ticket box or the
CI badges,
On Tuesday, January 31, 2023 at 12:00:20 PM UTC-8 Matthias Koeppe wrote:
> Yes, that is planned as the last item in
> https://github.com/sagemath/trac-to-github/issues/73
> This will need help from a Trac
Yes, that is planned as the last item
in https://github.com/sagemath/trac-to-github/issues/73
This will need help from a Trac admin.
On Tuesday, January 31, 2023 at 11:31:16 AM UTC-8 John H Palmieri wrote:
> Is there going to be one more round of (presumably automatic) additions to
> trac,
Is there going to be one more round of (presumably automatic) additions to
trac, providing a link from each trac ticket to the corresponding GH issue?
On Monday, January 30, 2023 at 2:06:34 PM UTC-8 dim...@gmail.com wrote:
> On Mon, Jan 30, 2023 at 9:56 PM Kwankyu Lee wrote:
> >
> > On
On Tue, Jan 31, 2023 at 4:59 PM Shiyue Li wrote:
>
> I agree that I don’t want isolated vertices. But putting “-c” would eliminate
> all graphs of the given edge size n that have more than 1 connected
> components. I would still want to consider those. For example, a tree of 4
> edges together
Amazing, can't wait to see the result!
Best,
Antoine
Le mardi 31 janvier 2023 à 02:11:21 UTC+1, Kwankyu Lee a écrit :
> Be fastened!
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from
There are infinitely many graphs with n edges (just keep throwing in
more isolated vertices)
That is, you basically need to restrict to connected ones only (as a
variation, only ones without isolated vertices).
sage: graphs.nauty_geng?
will tell you
The possible options, obtained as
