Hellooo !!!
Don't know if this is a bug, but sage numerically disagrees with
a paper about strong product of graphs.
I would trust Sage in that case :-D
I implemented |strong_product| and don't get the same products as sage
(C_4 bound passed, the Kneser one
On Wed, Dec 05, 2012 at 10:45:28AM +0100, Nathann Cohen wrote:
Hellooo !!!
Don't know if this is a bug, but sage numerically disagrees with
a paper about strong product of graphs.
I would trust Sage in that case :-D
I implemented |strong_product| and don't
The sage session i gave was on vanilla sage, didn't include results from
my implementation.
Good. There's been a patch on this function very recently :
http://trac.sagemath.org/sage_trac/ticket/13699
Is your version of Sage more recent than that ?
If so, as it looks like there's still a bug,
On Wed, Dec 05, 2012 at 11:27:21AM +0100, Nathann Cohen wrote:
The sage session i gave was on vanilla sage, didn't include results from
my implementation.
Good. There's been a patch on this function very recently :
http://trac.sagemath.org/sage_trac/ticket/13699
Is your version of
Hellooo !!
I now have my own cherished computed in front of my hands :
sage: C4=graphs.CycleGraph(4);K=graphs.CompleteGraph(3)
sage: G=C4.strong_product(K)
sage: G.chromatic_number()
6
sage: F=K.strong_product(C4)
sage: F.chromatic_number()
6
God, I love those bugfixes The
