# Problem Set 1

Description:

Problem set on bipartite graphs, matrix inequalities and lower bounds for λ2, the eﬃcacy of spectral partitioning, proving the Chernoﬀ bound, the existence of bipartite expanders, expander codes, eigenvalues, vertex degrees, indepedent sets, and graph coloring.

Resource Type:
Assignments

#### Learning Resource Types

assignment Problem Sets
notes Lecture Notes