图论导论
An introduction to graph theory
AI总结:
本文是研究生层次的图论课程导论,系统介绍图的基本类型、经典定理、网络流与匹配,并配有约百道无解答习题。
摘要:
这是一份研究生水平的图论导论,对应一门为期一个学季的课程。内容涵盖简单图、多重图及其有向对应形式,以及竞赛图、树和树形图等限制更强的图类。所讨论的专题包括 Euler 回路、Hamilton 圈、生成树、矩阵树定理与 BEST 定理、正常着色、Turan 定理、二部图匹配,以及 Menger 定理和 Gallai–Milgram 定理。书中还介绍网络流基础,用以证明 Hall 婚配定理。全书包含约一百道习题,但不附解答。
英文摘要:
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and arborescences. Among the features discussed are Eulerian circuits, Hamiltonian cycles, spanning trees, the matrix-tree and BEST theorems, proper colorings, Turan's theorem, bipartite matching and the Menger and Gallai--Milgram theorems. The basics of network flows are introduced in order to prove Hall's marriage theorem. Around a hundred exercises are included (without solutions).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。