She solved it in her head. Then she turned the page.
She wasn’t an instructor. She was a third-year Ph.D. student stuck on a single lemma about Hamiltonian cycles. But the basement had no security cameras, and her advisor had said, “Ask the library for miracles.”
That evening, she returned to the basement. The manual was still there, as if waiting. She took it to her apartment.
She saw the manual differently.
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 .
She shook her head. Tired. That’s all.
She laughed. That had to be a joke.
But in the blankness, written in ultraviolet ink that only revealed itself once you had traced the odd cycle, were two sentences:
By page 30, something strange happened.
Elena’s blood went cold. She flipped to page 347. Combinatorics And Graph Theory Harris Solutions Manual
Thanks to Harris, Hirst, and Mossinghoff — and to the copy in the basement, which found me first.
By Chapter 7 — Planar Graphs — the world had begun to rearrange itself permanently. Elena saw the subway map as a non-planar embedding in need of Kuratowski’s theorem. Her cat’s fur was a bipartite graph (white and black vertices, contact edges). Her own reflection in the mirror was a fixed point of an involution on the set of all possible hairstyles.