The Unofficial Guide to "Pearls in Graph Theory": Strategies for Mastery Nora Hartsfield and Gerhard Ringel’s Pearls in Graph Theory: A Comprehensive Introduction

4. Euler’s Formula for Planar Graphs

• Dirac: If a simple graph on n ≥ 3 vertices has minimum degree ≥ n/2, it is Hamiltonian.
• Ore: If every pair of nonadjacent vertices has degree sum ≥ n, the graph is Hamiltonian.
• Why they’re pearls: Clean, easy-to-check sufficient conditions for Hamilton cycles.
• Typical uses: Constructive guarantees in tournaments, network routing, and contest problems.

Pearl 3: Minimum Spanning Tree Problem

While the official solution manual for Pearls is not widely distributed (more on that later), the collective work of the mathematical community has produced unofficial guides. Below are typical problem categories and the kind of reasoning you would find in a quality solution manual.

• Pearls in Graph Theory – 1994 Dover reprint (affordable, legal).
• Instructor resources – Contact your university’s math department.
• Open-source solutions – GitHub repository "GraphTheoryPearlsSolutions" (community-maintained).

Category 3: Non-Existence Proofs