{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/extra-pearls-in-graph-theory","title":"Extra pearls in graph theory","arxiv_id":"1812.06627","date":"2018-12-17","proceeding":null,"authors":["Anton Petrunin"],"abstract":"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.","url_abs":"https://arxiv.org/abs/1812.06627v11","url_pdf":"https://arxiv.org/pdf/1812.06627v11.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"extra-pearls-in-graph-theory","repo_url":"https://github.com/anton-petrunin/graph-theory","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}