Mathematics - Combinatorics Mathematics - History and Overview
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).
Metrics
13 Record Views
Details
Title
An introduction to graph theory
Creators
Darij Grinberg
Publication Details
arXiv.org
Resource Type
Preprint
Language
English
Academic Unit
Mathematics
Other Identifier
991021862240904721
Research Home Page
Browse by research and academic units
Learn about the ETD submission process at Drexel
Learn about the Libraries’ research data management services