On Thu, 19 Oct 2017, Jori Mantysalo wrote:
Might be worth trying to use from_graph6 directly.
Tested. Don't bother, does not give really speedup that would mean
something.
--
Jori Mäntysalo
No, rather in threejs only one of overlapping triangles is shown and it is
the one whose center is closer or something like this. And show/not show is
binary without taking transparency into account. I think this is where Paul
was explaining some details:
https://trac.sagemath.org/ticket/22123#
On Thu, 19 Oct 2017, Christian Stump wrote:
But this seems to be too slow, already because it takes too long for this to
turn the graph6 string from nauty into a sage graph.
Might be worth trying to use from_graph6 directly. Currenty nauty_geng()
says G = graph.Graph(s[:-1], format='graph6'),
Hi,
how can I generate, in a fast enough way, connected graphs for which the
clique complex is pure, ie, for which all containmentwise maximal cliques
are of the same size ?
Fast enough here means that I can produce examples of such graphs with 20
vertices, edge degrees between 10 and 14 (an
