ConceptTheory & Algos
Robustification of bipartiteness and quadratic form
A graph G has a function with quadratic form close to two if and only if G is almost bipartite or has an almost perfect maximum cut.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Bipartiteness and quadratic form upper bound1Maximum cut1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.