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
Description: Digital signature
