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.
Elena looked up from the manual and saw the library’s reading room not as a room, but as a graph . The desks were vertices. The students were edges — no, wait: students were walks between desks. She could see the adjacency matrix of the room pulsing faintly in the air. An undergrad shuffled past, and Elena instinctively computed: degree 3, not Eulerian, but close . Combinatorics And Graph Theory Harris Solutions Manual
She kept reading. The next day, she solved her Hamiltonian cycle problem in twenty minutes. Her advisor, Dr. Voss, stared at the proof. Problem 11