This problem really piqued my interest in graph theory, as well as did my first homework assignment. At a certain dance there are two rules that hold: 1. No b

This problem really piqued my interest in graph theory, as well as did my first homework assignment. At a certain dance there are two rules that hold: 1. No boy dances with every girl. 2. Every girl dances with some boy. Prove that there are at least two couples that dance, B1-G1 and B2-G2, such that there is no crossing, neither B1-G2 nor B2-G1 Happy holidays HN!