Discrete Mathematics

Learn Graph theory

Nodes, edges, and the shapes connection makes.

Free to start · adaptive placement finds your level · reviews timed so it stays learned.

What you'll learn

36 lessons in Graph theory

Graphs & basic propertiesEuler paths & circuitsTrees & coloringSpanning treesShortest pathsBipartite matchingDirected graphs & cyclesPlanar graphs & Euler's formulaGraph isomorphismNetwork flow & max-flow min-cutHamiltonian cycles & TSPDFS, BFS & traversalsStrongly connected componentsSpectral graph theoryExpander graphsProof: handshake lemmaProof of Euler's formula $V - E + F = 2$Proof: 6-color theorem (the easy one)Graph minors & Robertson-SeymourRandom graphsHall's marriage theorem & König's theoremConnectivity & Menger's theoremThe chromatic polynomialTurán's theorem & extremal graph theoryVizing's theorem & edge coloringCayley's formula & the Matrix-Tree theoremTutte's theorem & perfect matchingsTournamentsRamsey numbers & Ramsey theoryPerfect graphsSzemerédi's regularity lemmaKuratowski & Wagner: characterizing planarityList coloring & choosabilityCrossing numbers & the crossing lemmaGraph genus & surface embeddingsThe Lovász theta function & Shannon capacity
How Erudia teaches

Built to be understood — and remembered.

Every idea is taught with motivation and a worked example before the drills, and an FSRS spaced-repetition engine schedules each review for the moment just before you'd forget it. A short placement check finds what you already know, so you start Graph theory exactly where it's useful.

Related Discrete Mathematics subjects