LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Graphs and Coloring
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Graphs and Coloring

81 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 11

Zachary Abel teaches Lecture 11 of MIT's 6.1200J Mathematics for Computer Science, covering graph theory fundamentals and the coloring problem. The lecture works through different types of graphs and the definitions that make them useful for modeling scheduling conflicts, communication networks, and search problems. Abel develops graph coloring as a way to assign labels so that connected vertices never share a color, building toward the chromatic number and the kinds of proofs used to bound it. Expect board work with definitions, theorems, and worked examples rather than slides, in the standard MIT OCW recorded-lecture format. Running 81 minutes, the lecture assumes the discrete math groundwork laid in earlier sessions of the course and fits into the broader unit on graph theory that follows it with topics like matching and connectivity.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 21 m
Compared with MathematicsLonger than 81%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 9 of 2210 h 40 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN