We present new tests for detecting a community in a random bipartite graph and prove that they are minimax optimal.