Dan, http://trac.sagemath.org/sage_trac/ticket/12155
http://groups.google.com/group/sage-devel/t/9fc4c6bfa8d005b3 ;-) Rob On Dec 14, 6:52 pm, Dan Drake <dr...@kaist.edu> wrote: > I'm refereeing a paper on matching polynomials, so I want to use Sage to > check some things. This is literally the very first thing I tried: > > sage: g = graphs.CompleteBipartiteGraph(4,3) > sage: g.matching_polynomial() > [traceback] > RuntimeError: Edge vertices must lie in different partitions. > > I tried a complete graph, some cycles, and the Petersen graph; those > worked. But then I got: > > sage: g = graphs.CubeGraph(5) > sage: g.matching_polynomial() > [...] > TypeError: an integer is required > > What is going on? Are these bugs? Or some kind of PEBKAC? I can't find > any related tickets. I can imagine raising a NotImplementedError, or if > my graphs were larger, some kind of "your computation will take too long > / too much memory" error...but those are small, basic graphs. > > Comments? > > Dan > > -- > --- Dan Drake > ----- http://mathsci.kaist.ac.kr/~drake > ------- > > signature.asc > < 1KViewDownload -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
