We prove that every graph with at most (3.75 - o(1))n edges has a ... Bears versus the demon on Kn,n, part II presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan ...