18.226 | Fall 2022 | Graduate

Probabilistic Methods in Combinatorics

Large Bipartite Subgraph

A simple application of the probabilistic method in combinatorics: a proof that every graph contains a large bipartite subgraph with at least half of the edges.

Course Info

Instructor

Departments

As Taught In

Fall 2022

Level

Graduate

Topics

Learning Resource Types

Instructor Insights
Lecture Notes
Lecture Videos
Open Textbooks
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology