MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $G = (X \cup Y, E)$ be a random bipartite graph, where $X$ and $Y$ are the set of vertices and $E$ the set of edges. I want to find an upper bound of the largest biclique in which exactly $k$ vertices of $X$ are part of the biclique. A biclique of $G$ is a set of vertices $X' \subset X$ and $Y' \subset Y$ where there is a edge between each node $x \in X'$ and each node $y \in Y'$. Could any of you help me on this? Thanks!

share|cite|improve this question
This is very elementary. Is it homework? – Brendan McKay Dec 29 '12 at 1:28
No. I know some upper bounds.. but i need an algorithm to find a strong one, since i'm using it to write a branch-and-bound algorithm to solve the problem. – totheend Dec 29 '12 at 12:03

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.