I think backward compatibility is a strong argument to keep returning True.
I also have an answer based on "my favorite definition is ...", namely the analogue with matroid connectivity, where any matroid that is too small to have a k-separation, is automatically k-connected. Extending this to graphs, the empty graph should be infinitely connected. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/groups/opt_out.
