A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...

There’s a path between any two dots — what graph theorists call vertices — and no path is longer than two line segments, or edges. (Note: In the puzzle and throughout the column, paths are not allowed ...