We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) n-by-n matrix is Θ(n 4/3 ) (resp. Θ(n 3/2 )). Relationships with point-line incidences in the plane, Bruhat order of permutations, and T P completability are also presented. We also examine the number and positionings of equal 2-by-2 minors in a 2-by-n T P matrix, and give a relationship between the location of equal 2-by-2 minors and outerplanar graphs.