Graph Theory - KIT
Graph TheoryLecture by Prof. Dr. Maria AxenovichLecture notes by M onika Csik os, Daniel Hoske and Torsten Ueckerdt1Contents1 Preliminaries42 Matchings173 Connectivity254 Planar graphs365 Colorings526 Extremal Graph theory647 Ramsey theory758 Flows869 Random graphs9310 Hamiltonian cycles99References101Index1022Introducti onThese notes include major definitions, theorems, and proofs for the Graph Theory coursegiven by Prof. Maria Axenovich at KIT during the winter term 2019/20. Most of thecontent is based on the book Graph Theory by Reinhard Diestel [4]. A free versionof the book is available : G= (V,E) is an arbitrary (undirected, simple) Graph n:=|V|is its number of vertices m:=|E|is its number of edgesNotationnotationdefinitionmeaning(V k),Vfinite set,kinteger{S V:|S|=k}the set of allk-elementsubsets ofVV2,Vfinite set{(u,v) :u,v V, u6=v}the set of all ordered pairsof elements inV[n],ninteger{1.}
Introduction These notes include major de nitions, theorems, and proofs for the graph theory course given by Prof. Maria Axenovich at KIT during the winter term 2019/20.
Download Graph Theory - KIT
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: