Problem 11.5: Construct a graph H such that the number of spanning trees of H is equal to the number of solutions to the Riemann Hypothesis with imaginary part less than 100.
“Harris,” she said, and smiled.
She laughed. That had to be a joke.
She solved it in her head. Then she turned the page. Combinatorics And Graph Theory Harris Solutions Manual
But in the blankness, written in ultraviolet ink that only revealed itself once you had traced the odd cycle, were two sentences: Problem 11
I understand you're looking for a story involving a "Combinatorics and Graph Theory" solutions manual by Harris — likely referring to the textbook Combinatorics and Graph Theory by John M. Harris, Jeffry L. Hirst, and Michael J. Mossinghoff. ” she said
