Connectivity and Menger’s theorem; embeddings of graphs and Kuratowski’s theorem; network flows; crossing number; structure of k-chromatic graphs; Ramsey theory; extremal graph theory; probabilistic methods and random graphs; eigenvalues and eigenvectors of graphs.