This paper concerns the open problem of Lovasz and Saks regarding the relationship between the communication complexityof a boolean function and the rank of the associated matrix.We first give an example exhibiting the largest gap known. We thenprove two related theorems.