Papers › Extra pearls in graph theory
Extra pearls in graph theory
Anton Petrunin
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This is a supplement for "Pearls in graph theory" -- a textbook written by Nora Hartsfield and Gerhard Ringel. We discuss the following topics: Ramsey theory, Probabilistic method, Deletion-contraction formulas, Matrix theorem, Graph-polynomials, Generating functions, Minimum spanning trees, Marriage theorem and its relatives, Toroidal graphs, Rado graph, Rewriting systems.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections