1 problem

Let $G$ be a balanced red-blue graph with $n$ vertices and $m$ edges. An alternating-circuit bound asserts that 1. there exists an alternating circuit of length at most $3n^2/m$; a…