On Wed, Dec 05, 2012 at 10:45:28AM +0100, Nathann Cohen wrote: > Hellooooooooooooooooooooooooooooooo !!! > > > 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 didn't pass with my code). > > > > What is the drama? > > > > (Didn't audit sage's strong_product). > > Well, did you try Sage's strong_product method, or did you write your own ? >
The sage session i gave was on vanilla sage, didn't include results from my implementation. sage is contradicting at least one more paper on strong products FYI. > Anyway, Sage can compute chromatic numbers in many different ways (see > g.chromatic_number? ). I would say that if they all answer the same > result then the problem lies in the product, otherwise it (obviously) > lies in the coloring functions :-) > > Good luck ! > > Nathann -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support?hl=en.
